Complexity Theory of Polynomial-Time Problems
|
|
- Justin Harrison
- 5 years ago
- Views:
Transcription
1 Complexity Theory of Polynomial-Time Problems Lecture 5: Subcubic Equivalences Karl Bringmann
2 Reminder: Relations = Reductions transfer hardness of one problem to another one by reductions problem P instance I size n reduction r(n) time problem Q instance J size s(n) I is a yes -instance () J is a yes -instance t(n) algorithm for Q implies a r n + t(s n ) algorithm for P if P has no r n + t(s n ) algorithm then Q has no t(n) algorithm
3 Reminder: Relations = Reductions problem P instance I size n reduction total time r(n) problem Q instance I 1 size n. instance I k size n 0
4 Subcubic Reduction A subcubic reduction from P to Q is an algorithm A for P with oracle access to Q s.t.: problem P instance I reduction problem Q instance I 1 size n. Properties: size n total time r(n) instance I k size n 0 for any instance I, algorithm A(I) correctly solves problem P on I A runs in time r(n) = O(n 567 ) for some γ > 0 for any ε > 0 there is a δ > 0 s.t. 0 n 56? >@. > n 56B
5 Subcubic Reduction A subcubic reduction from P to Q is an algorithm A for P with oracle access to Q with: Properties: problem Q problem P reduction instance I instance A subcubic I reduction implies: 1 size n. If Q has an O(n 56C ) algorithm for some α > 0, then P has an O(n 56E ) algorithm for some β > 0 size n total time instance I k r(n) size n 0 for any instance I, algorithm A(I) correctly solves problem P on I A runs in time r(n) = O(n 567 ) for some γ > 0 for any ε > 0 there is a δ > 0 s.t. 0 n 56? >@. > n 56B similar: subquadratic/subquartic reductions
6 Subcubic Reduction subcubic reduction: write P Q subcubic equivalent: write P Q if P Q and Q P Transitivity: (Exercise) For problems A, B, C with A B and B C we have A C. In particular: If A B and B C and C A then A, B, C are subcubic equivalent. B A C Lemma: (without proof) If A B and B is in time O n 5 /2N(OPQ R)S/T then A is in time O n 5 /2 N(OPQ R)S/T.
7 Reminder All-Pairs-Shortest-Paths (APSP): given a weighted directed graph G, compute the (length of the) shortest path between any pair of vertices each edge has a weight in {1,.., n W } Floyd-Warshall 62: O(n 5 )... Williams 14: O n 5 /2N(OPQ R)S/T Conjecture: for any ε > 0 APSP has no O n 56? algorithm there exists c > 0 such that
8 Reminder Min-Plus Matrix Product: each entry in {1,.., n W, } given n. n [ -matrix A and n [ n 5 -matrix B, define their min-plus product as the n. n 5 -matrix C with C >,\ = min.`0`r T A >,0 + B 0,\ from definition: O n 5 (if n = n. = n [ = n 5 ) Conjecture: for any ε > 0 there is no O n 56? algorithm there exists c > 0 such that
9 Reminder Thm: If APSP has a T(n) algorithm then Min-Plus Product has an O(T n + n [ ) algorithm. Thm: If Min-Plus Product has a T(n) algorithm then APSP has an O((T n + n [ ) log n) algorithm. Consider adjacency matrix A of G n n n Add selfloops with cost 0: A + I Square log n times using Min-Plus w i, k = A[i, k] w k, j = B[k, j] Product: B (A + I) [ mno p Then B >,\ is the length of the shortest path from i to j
10 Subcubic Reduction A subcubic reduction from P to Q is an algorithm A for P with oracle access to Q with: problem P instance I reduction problem Q instance I 1 size n. Properties: size n total time r(n) instance I k size n 0 for any instance I, algorithm A(I) correctly solves problem P on I A runs in time r(n) = O(n 567 ) for some γ > 0 for any ε > 0 there is a δ > 0 s.t. 0 n 56? >@. > n 56B
11 Subcubic Equivalences Thm: IfAPSP has a T(n) algorithm then Min-Plus Product has an O(T(n)) algorithm. Thm: If Min-Plus Product has a T(n) algorithm then APSP has an O(T n log n) algorithm. APSP and Min-Plus Product are subcubic equivalent Cor: APSP has an O(n 56? ) algorithm for some ε > 0 if and only if Min-Plus Product has an O(n 56B ) algorithm for some δ > 0 Cor: Min-Plus Product is in time O n 5 /2N(OPQ R)S/T
12 Subcubic Equivalences 2 nd Shortest Path Maximum Submatrix Metricity APSP Min-Plus Product All-Pairs- Negative- Negative Betweenness Centrality Radius Median [Vassilevska-Williams,Williams 10] [Abboud,Grandoni,Vassilevska-Williams 15]
13 Problems Negative each edge has a weight in { n W,.., n W } Given a weighted directed graph G Decide whether there are vertices i, j, k such that w j, i + w i, k + w k, j < 0 from definition: O(n 5 ) no O n 56? algorithm known (which works for all c > 0) Intermediate problem: All-Pairs-Negative- Given a weighted directed graph G with vertex set V = I J K Decide for every i I, j J whether there is a vertex k K s.t. w j, i + w i, k + w k, j < 0
14 Subcubic Equivalences 2 nd Shortest Path Maximum Submatrix Metricity APSP Min-Plus Product All-Pairs- Negative- Negative Betweenness Centrality Radius Median [Vassilevska-Williams,Williams 10] [Abboud,Grandoni,Vassilevska-Williams 15]
15 Neg- to Min-Plus-Product Given a weighted directed graph G on vertex set {1,, n} Adjacency matrix A: A >,\ = weight of edge i, j, or if the edge does not exist Min-Plus Product Negative 1. Compute Min-Plus Product B A A: B >,\ = min 0 A >,0 + A 0,\ 2. Compute min >,\ A \,> + B >,\ this equals min >,\,0 A \,> + A >,0 + A 0,\ i.e. the smallest weight of any triangle thus we solved Negative A: Running Time: T Q ƒ QO n T ˆO Š n + O(n [ ) subcubic reduction
16 Subcubic Equivalences 2 nd Shortest Path Maximum Submatrix Metricity APSP Min-Plus Product All-Pairs- Negative- Negative Betweenness Centrality Radius Median [Vassilevska-Williams,Williams 10] [Abboud,Grandoni,Vassilevska-Williams 15]
17 A Min-Plus to All-Pairs-Neg- I K Add all edges from J to I with (carefully chosen) weights w(j, i) Run All-Pairs-Negative- algorithm J B n = 4 in the picture Min-Plus Product All-Pairs- Negative- Result: for all i, j, is there a k such that w j, i + w i, k + w k, j < 0? w i, k + w k, j < w j, i WANTED: Min-Plus: for all i, j: min 0 w i, k + w k, j = minimum number z s.t. there is a k s.t. w i, k + w k, j < z + 1 binary search via w j, i! simultaneous for all i, j!
18 A Min-Plus to All-Pairs-Neg- I binary search via w j, i! simultaneous for all i, j! K need that all (finite) weights are in { n W,, n W } each entry of Min-Plus Product is in { 2n W,, 2n W, } binary search takes log [ 4n W + 1 = O(log n) steps J B n = 4 in the picture Min-Plus Product All-Pairs- Negative-
19 A Min-Plus to All-Pairs-Neg- I K J binary search via w j, i! simultaneous for all i, j! B n = 4 in the picture Min-Plus Product All-Pairs- Negative- for all i, j: initialize m i, j 2n W and M(i, j): = 2n W repeat log (4n W ) times: for all i, j: set w j, i (m i, j + M(i, j))/2 compute All-Pairs-Negative- for all i, j: if i,j is in negative triangle: M i, j w j, i 1 otherwise: m i, j w j, i (missing: handling of )
20 A Min-Plus to All-Pairs-Neg- I K J B n = 4 in the picture Min-Plus Product All-Pairs- Negative- binary search takes log [ 4n W + 1 = O(log n) steps T(n) algorithm for All-Pairs-Neg- yields O(T(n) log n) algorithm for Min-Plus Product In particular: O(n 56? ) algorithm for All-Pairs-Neg- for some ε > 0 implies O(n 56? ) algorithm for Min-Plus Product for some ε > 0 subcubic reduction
21 Subcubic Equivalences 2 nd Shortest Path Maximum Submatrix Metricity APSP Min-Plus Product All-Pairs- Negative- Negative Betweenness Centrality Radius Median [Vassilevska-Williams,Williams 10] [Abboud,Grandoni,Vassilevska-Williams 15]
22 All-Pairs-Neg- to Neg- Negative Given graph G Decide whether there are vertices i, j, k such that w j, i + w i, k + w k, j < 0 All-Pairs- Negative- Negative All-Pairs-Negative- Given graph G with vertex set V = I J K Decide for every i I, j J whether there is a vertex k K such that w j, i + w i, k + w k, j < 0 K Split I, J, K into n/s parts of size s: I.,, I R/, J.,, J R/, K.,, K R/ I K J For each of the (n/s) 5 triples (I, J, K ): consider graph G[I J K ] I J
23 All-Pairs-Neg- to Neg- Initialize C as n n all-zeroes matrix For each of the (n/s) 5 triples of parts (I, J, K ): While G[I J K ] contains a negative triangle: Find a negative triangle (i, j, k) in G[I J K ] Set C i, j 1 Set w(i, j) (i, j) is in no more negative triangles K All-Pairs- Negative- Negative guaranteed termination: can set n [ weights to I K J correctness: if (i, j) is in negative triangle, we will find one I J
24 All-Pairs-Neg- to Neg- Find a negative triangle (i, j, k) in G[I J K ] How to find a negative triangle if we can only decide whether one exists? Partition I into I (.), I ([), J into J (.), J ([), K into K (.),K ([) All-Pairs- Negative- Negative Since G[I J K ] contains a negative triangle, at least one of the 2 5 subgraphs G[I (š) J ( ) K (W) ] contains a negative triangle K Decide for each such subgraph whether it contains a negative triangle I J Recursively find a triangle in one subgraph
25 All-Pairs-Neg- to Neg- Find a negative triangle (i, j, k) in G[I J K ] How to find a negative triangle if we can only decide whether one exists? Partition I into I (.), I ([), J into J (.), J ([), K into K (.),K ([) All-Pairs- Negative- Negative Since G[I J K ] contains a negative triangle, at least one of the 2 5 subgraphs G[I (š) J ( ) K (W) ] contains a negative triangle Running Time: T œ Q ƒ QO n Decide for each such subgraph whether it contains a negative triangle Recursively find a triangle in one subgraph 2 5 T Ÿ Q ƒ QO (n) + T œ Q ƒ QO n/2 = O(T Ÿ Q ƒ QO n )
26 All-Pairs-Neg- to Neg- Initialize C as n n all-zeroes matrix All-Pairs- Negative- For each of the (n/s) 5 triples of parts (I, J, K ): While G[I J K ] contains a negative triangle: Find a negative triangle (i, j, k) in G[I J K ] Set C i, j 1 Set w(i, j) ( ) Negative Running Time: ( ) = O(T œ Q ƒ QO (s)) = O(T Ÿ Q ƒ QO (s)) Total time: #triples + #triangles found ( ) n/s 5 + n [ T Ÿ Q ƒ QO (s) Set s = n./5 and assume T Ÿ Q ƒ QO n = O(n 56? ) Total time: O n [ n.6?/5 = O(n 56?/5 )
27 Subcubic Equivalences 2 nd Shortest Path Maximum Submatrix Metricity APSP Min-Plus Product All-Pairs- Negative- Negative Betweenness Centrality Radius Median [Vassilevska-Williams,Williams 10] [Abboud,Grandoni,Vassilevska-Williams 15]
28 Radius G is a weighted directed graph d(u, v) is the distance from u to v in G Radius: min max d(u, v) u is in some sense the most central vertex u w(u, v) v Radius APSP compute all pairwise distances, then evaluate definition of radius in time O(n [ ) subcubic reduction Radius is in time O n 5 /2N(OPQ R)S/T
29 Negative to Radius Radius Negative instance: graph G with n nodes, edge-weights in { n W,, n W } i w(i, j) j Radius instance: graph H with O(n) nodes, edge-weights in {0,, O(n W )} i i i i ¹ j j j j ¹ Negative M = 3n W 1) Make four layers with n nodes 2) For any edge (i, j): Add i, j, i, j, i,j ¹ with weight M + w(i, j) A B C D
30 Negative to Radius Radius Negative instance: graph G with n nodes, edge-weights in { n W,, n W } i w(i, j) j k (i, j, k) has weight W Radius instance: graph H with O(n) nodes, edge-weights in {0,, O(n W )} i i ¹ j k Negative M = 3n W 1) Make four layers with n nodes 2) For any edge (i, j): Add i, j, i, j, i,j ¹ with weight M + w(i, j) A B C D path has length 3M + W i, j, k,i ¹ -path of length 3M 1?
31 Negative to Radius Radius Negative instance: graph G with n nodes, edge-weights in { n W,, n W } i w(i, j) j k (i, j, k) has weight W Radius instance: graph H with O(n) nodes, edge-weights in {0,, O(n W )} i i ¹ j k Negative M = 3n W 1) Make four layers with n nodes 2) For any edge (i, j): Add i, j, i, j, i,j ¹ with weight M + w(i, j) A B C D path has length 3M + W 3) Add edges of weight 3M 1 from any i to all nodes except i ¹ (and i ) i, j, k,i ¹ -path of length 3M 1? Radius: min max d(u, v) Claim: Radius of H is 3M 1 iff there is a negative triangle in G
32 Negative to Radius Radius Claim: Proof: Radius of H is 3M 1 iff there is a negative triangle in G Negative If there is a negative triangle (i, j, k) then i is in distance 3M 1 to i ¹ (by (2)), and in distance 3M 1 to any other vertex (by (3)), so the radius is max d i, v 3M 1 If there is no negative triangle i, j, k : Any node u of the form i /i /i ¹ cannot reach A, so it has max d u, v = Any i is in distance 3M to i ¹, since there is no i, j, k,i ¹ -path of length 3M 1 (note that the edges added in (3) also do not help) Hence, for all u, max d u, v 3M, and thus the radius is at least 3M
33 Subcubic Equivalences 2 nd Shortest Path Maximum Submatrix Metricity APSP Min-Plus Product All-Pairs- Negative- Negative Betweenness Centrality Radius Median [Vassilevska-Williams,Williams 10] [Abboud,Grandoni,Vassilevska-Williams 15]
34 MaxSubmatrix MaxSubmatrix: given an n n matrix A with entries in { n W,.., n W } Σ B sum of all entries of matrix B compute maximum Σ B over all submatrices B of A y. y [ A B x. x [ Thm: MaxSubmatrix is subcubic equivalent to APSP [Tamaki,Tokuyama 98] [Backurs,Dikkala,Tzamos 16] there are O(n ¾ ) possible submatrices B computing Σ B : O(n [ ) trivial running time: O(n ) Exercise: design an O(n 5 ) algorithm
35 MaxSubmatrix MaxSubmatrix: given an n n matrix A with entries in { n W,.., n W } Σ B sum of all entries of matrix B compute maximum Σ B over all submatrices B of A y. y [ A B x. x [ Thm: MaxSubmatrix is subcubic equivalent to APSP [Tamaki,Tokuyama 98] [Backurs,Dikkala,Tzamos 16] MaxCenteredSubmatrix: compute maximum Σ B over all submatrices B of A containing the center of A i.e. we require x. n/2 < x [ and y. n/2 < y [ Thm: MaxCenteredSubmatrix is subcubic equ. to APSP A we only prove: Negative MaxCenteredSubmatrix B Exercise: MaxCenteredSubmatrix APSP
36 Neg to MaxCentSubmatrix A Positive instance: graph G with n nodes, edge-weights in { n W,, n W } i w(i, j) MaxCenteredSubmatrix: 2n 2n-matrix A entries in { n Â(W),, n  (W) } y. y [ B x. x [ M 2n WÃ5 j k y. = k II I In quadrant II we want for any k, i: R R Æ Æ A, = w(k, i) Σ B ÄÄ = w(k, i) Σ B Ä = this is satisfied by defining: A 0,> w k, i w k + 1, i y [ n = i w k, i w(k + 1, i + 1) (where w x, y 0 for x > n or y > n) M M M M [ III M 0 M M Σ B ÄÅ = w(i, j) IV x. = i x [ n = j
37 Neg to MaxCentSubmatrix A Positive instance: graph G with n nodes, edge-weights in { n W,, n W } i MaxCenteredSubmatrix: 2n 2n-matrix A entries in { n Â(W),, n  (W) } y. y [ B x. x [ M 2n WÃ5 w(i, j) j k In quadrant II we want for any k, i: R R Æ Æ A, = this is satisfied by defining: A 0,> w k, i w k + 1, i w k, i w(k + 1, i + 1) (where w x, y 0 for x > n or y > n) With this definition of A, for any 1 k, i n: R R Æ R R = Æ Æw y, x w y w y, x + 1 +w(y + 1, x + 1) where any w(y,x) with k < y n and i < x n appears with factors = 0 and any w y, x, s.t. exactly one of y = k or y = n + 1 or x = i or x = n + 1 holds, appears with factors +1 1 = 0 and since w(y, n + 1) = w(n + 1, x) = 0, the only remaining summand is w(k, i)
38 Neg to MaxCentSubmatrix A Positive instance: graph G with n nodes, edge-weights in { n W,, n W } MaxCenteredSubmatrix: 2n 2n-matrix A entries in { n Â(W),, n  (W) } y. y [ B x. x [ i w(i, j) Claim: MaxCentSubmatrix of A is > M iff G has a positive triangle M 2n WÃ5 j k y. = k II I In quadrant II we want for any k, i: R R Æ Æ A, = w(k, i) Σ B ÄÄ = w(k, i) Σ B Ä = this is satisfied by defining: A 0,> w k, i w k + 1, i y [ n = i w k, i w(k + 1, i + 1) (where w x, y 0 for x > n or y > n) M M M M [ III M 0 M M Σ B ÄÅ = w(i, j) IV x. = i x [ n = j
39 Summary 2 nd Shortest Path Maximum Submatrix Metricity APSP Min-Plus Product All-Pairs- Negative- Negative Betweenness Centrality Radius Median
Complexity Theory of Polynomial-Time Problems
Complexity Theory of Polynomial-Time Problems Lecture 8: (Boolean) Matrix Multiplication Karl Bringmann Recall: Boolean Matrix Multiplication given n n matrices A, B with entries in {0,1} compute matrix
More informationSubcubic Equivalence of Triangle Detection and Matrix Multiplication
Subcubic Equivalence of Triangle Detection and Matrix Multiplication Bahar Qarabaqi and Maziar Gomrokchi April 29, 2011 1 Introduction An algorithm on n n matrix with the entries in [ M, M] has a truly
More informationComplexity Theory of Polynomial-Time Problems
Complexity Theory of Polynomial-Time Problems Lecture 1: Introduction, Easy Examples Karl Bringmann and Sebastian Krinninger Audience no formal requirements, but: NP-hardness, satisfiability problem, how
More informationComplexity Theory of Polynomial-Time Problems
Complexity Theory of Polynomial-Time Problems Lecture 13: Recap, Further Directions, Open Problems Karl Bringmann I. Recap II. Further Directions III. Open Problems I. Recap Hard problems SAT: OV: APSP:
More informationCS367 Lecture 3 (old lectures 5-6) APSP variants: Node Weights, Earliest Arrivals, Bottlenecks Scribe: Vaggos Chatziafratis Date: October 09, 2015
CS367 Lecture 3 (old lectures 5-6) APSP variants: Node Weights, Earliest Arrivals, Bottlenecks Scribe: Vaggos Chatziafratis Date: October 09, 2015 1 The Distance Product Last time we defined the distance
More informationMatching Triangles and Basing Hardness on an Extremely Popular Conjecture
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture Amir Abboud 1, Virginia Vassilevska Williams 1, and Huacheng Yu 1 1 Computer Science Department, Stanford University Abstract Due
More informationCS173 Lecture B, November 3, 2015
CS173 Lecture B, November 3, 2015 Tandy Warnow November 3, 2015 CS 173, Lecture B November 3, 2015 Tandy Warnow Announcements Examlet 7 is a take-home exam, and is due November 10, 11:05 AM, in class.
More informationLecture 4: An FPTAS for Knapsack, and K-Center
Comp 260: Advanced Algorithms Tufts University, Spring 2016 Prof. Lenore Cowen Scribe: Eric Bailey Lecture 4: An FPTAS for Knapsack, and K-Center 1 Introduction Definition 1.0.1. The Knapsack problem (restated)
More informationComplexity Theory of Polynomial-Time Problems
Complexity Theory of Polynomial-Time Problems Lecture 11: Nondeterministic SETH Karl Bringmann Complexity Inside P SAT 2 n 3SUM n 2 OV n 2 Colinearity n 2 3SUM-hard APSP n 3 APSP equivalent Radius n 3
More informationComplexity Theory of Polynomial-Time Problems
Complexity Theory of Polynomial-Time Problems Lecture 3: The polynomial method Part I: Orthogonal Vectors Sebastian Krinninger Organization of lecture No lecture on 26.05. (State holiday) 2 nd exercise
More informationComplexity Theory of Polynomial-Time Problems
Complexity Theory of Polynomial-Time Problems Lecture 2: SETH and OV Karl Bringmann Tutorial Slot Tuesday, 16:15-18:00 works for everybody? alternative time slot: Mo Tue Wed Thu Fri 10-12 12-14 new 14-16
More informationNP and Computational Intractability
NP and Computational Intractability 1 Polynomial-Time Reduction Desiderata'. Suppose we could solve X in polynomial-time. What else could we solve in polynomial time? don't confuse with reduces from Reduction.
More informationLecture Notes for Chapter 25: All-Pairs Shortest Paths
Lecture Notes for Chapter 25: All-Pairs Shortest Paths Chapter 25 overview Given a directed graph G (V, E), weight function w : E R, V n. Goal: create an n n matrix of shortest-path distances δ(u,v). Could
More informationNote that M i,j depends on two entries in row (i 1). If we proceed in a row major order, these two entries will be available when we are ready to comp
CSE 3500 Algorithms and Complexity Fall 2016 Lecture 18: October 27, 2016 Dynamic Programming Steps involved in a typical dynamic programming algorithm are: 1. Identify a function such that the solution
More informationShortest paths with negative lengths
Chapter 8 Shortest paths with negative lengths In this chapter we give a linear-space, nearly linear-time algorithm that, given a directed planar graph G with real positive and negative lengths, but no
More informationClassical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems
Classical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems Rani M. R, Mohith Jagalmohanan, R. Subashini Binary matrices having simultaneous consecutive
More informationAlgorithms and Theory of Computation. Lecture 22: NP-Completeness (2)
Algorithms and Theory of Computation Lecture 22: NP-Completeness (2) Xiaohui Bei MAS 714 November 8, 2018 Nanyang Technological University MAS 714 November 8, 2018 1 / 20 Set Cover Set Cover Input: a set
More informationarxiv: v1 [cs.ds] 27 Mar 2017
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can) Karl Bringmann Paweł Gawrychowski Shay Mozes Oren Weimann arxiv:1703.08940v1 [cs.ds] 27 Mar 2017 Abstract The edit distance
More informationTree-width and algorithms
Tree-width and algorithms Zdeněk Dvořák September 14, 2015 1 Algorithmic applications of tree-width Many problems that are hard in general become easy on trees. For example, consider the problem of finding
More informationTree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can)
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can) Karl Bringmann Paweł Gawrychowski Shay Mozes Oren Weimann Abstract The edit distance between two rooted ordered trees with
More informationLecture 18: More NP-Complete Problems
6.045 Lecture 18: More NP-Complete Problems 1 The Clique Problem a d f c b e g Given a graph G and positive k, does G contain a complete subgraph on k nodes? CLIQUE = { (G,k) G is an undirected graph with
More information8. INTRACTABILITY I. Lecture slides by Kevin Wayne Copyright 2005 Pearson-Addison Wesley. Last updated on 2/6/18 2:16 AM
8. INTRACTABILITY I poly-time reductions packing and covering problems constraint satisfaction problems sequencing problems partitioning problems graph coloring numerical problems Lecture slides by Kevin
More informationCS 4407 Algorithms Lecture: Shortest Path Algorithms
CS 440 Algorithms Lecture: Shortest Path Algorithms Prof. Gregory Provan Department of Computer Science University College Cork 1 Outline Shortest Path Problem General Lemmas and Theorems. Algorithms Bellman-Ford
More informationLearning Large-Alphabet and Analog Circuits with Value Injection Queries
Learning Large-Alphabet and Analog Circuits with Value Injection Queries Dana Angluin 1 James Aspnes 1, Jiang Chen 2, Lev Reyzin 1,, 1 Computer Science Department, Yale University {angluin,aspnes}@cs.yale.edu,
More informationChapter 11. Approximation Algorithms. Slides by Kevin Wayne Pearson-Addison Wesley. All rights reserved.
Chapter 11 Approximation Algorithms Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights reserved. 1 Approximation Algorithms Q. Suppose I need to solve an NP-hard problem. What should
More information16.1 Min-Cut as an LP
600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: LPs as Metrics: Min Cut and Multiway Cut Date: 4//5 Scribe: Gabriel Kaptchuk 6. Min-Cut as an LP We recall the basic definition
More informationGeneral Methods for Algorithm Design
General Methods for Algorithm Design 1. Dynamic Programming Multiplication of matrices Elements of the dynamic programming Optimal triangulation of polygons Longest common subsequence 2. Greedy Methods
More informationFinite Metric Spaces & Their Embeddings: Introduction and Basic Tools
Finite Metric Spaces & Their Embeddings: Introduction and Basic Tools Manor Mendel, CMI, Caltech 1 Finite Metric Spaces Definition of (semi) metric. (M, ρ): M a (finite) set of points. ρ a distance function
More informationFlows. Chapter Circulations
Chapter 4 Flows For a directed graph D = (V,A), we define δ + (U) := {(u,v) A : u U,v / U} as the arcs leaving U and δ (U) := {(u,v) A u / U,v U} as the arcs entering U. 4. Circulations In a directed graph
More informationLecture 22: Counting
CS 710: Complexity Theory 4/8/2010 Lecture 22: Counting Instructor: Dieter van Melkebeek Scribe: Phil Rydzewski & Chi Man Liu Last time we introduced extractors and discussed two methods to construct them.
More informationAnalysis of Algorithms I: All-Pairs Shortest Paths
Analysis of Algorithms I: All-Pairs Shortest Paths Xi Chen Columbia University The All-Pairs Shortest Paths Problem. Input: A directed weighted graph G = (V, E) with an edge-weight function w : E R. Output:
More informationChapter 9: Relations Relations
Chapter 9: Relations 9.1 - Relations Definition 1 (Relation). Let A and B be sets. A binary relation from A to B is a subset R A B, i.e., R is a set of ordered pairs where the first element from each pair
More informationThe minimum G c cut problem
The minimum G c cut problem Abstract In this paper we define and study the G c -cut problem. Given a complete undirected graph G = (V ; E) with V = n, edge weighted by w(v i, v j ) 0 and an undirected
More informationDiscrete Optimization 2010 Lecture 2 Matroids & Shortest Paths
Matroids Shortest Paths Discrete Optimization 2010 Lecture 2 Matroids & Shortest Paths Marc Uetz University of Twente m.uetz@utwente.nl Lecture 2: sheet 1 / 25 Marc Uetz Discrete Optimization Matroids
More informationCS151 Complexity Theory
Introduction CS151 Complexity Theory Lecture 5 April 13, 2004 Power from an unexpected source? we know PEXP, which implies no polytime algorithm for Succinct CVAL poly-size Boolean circuits for Succinct
More informationDesign and Analysis of Algorithms
Design and Analysis of Algorithms CSE 5311 Lecture 22 All-Pairs Shortest Paths Junzhou Huang, Ph.D. Department of Computer Science and Engineering CSE5311 Design and Analysis of Algorithms 1 All Pairs
More informationR ij = 2. Using all of these facts together, you can solve problem number 9.
Help for Homework Problem #9 Let G(V,E) be any undirected graph We want to calculate the travel time across the graph. Think of each edge as one resistor of 1 Ohm. Say we have two nodes: i and j Let the
More information- Well-characterized problems, min-max relations, approximate certificates. - LP problems in the standard form, primal and dual linear programs
LP-Duality ( Approximation Algorithms by V. Vazirani, Chapter 12) - Well-characterized problems, min-max relations, approximate certificates - LP problems in the standard form, primal and dual linear programs
More informationLimits to Approximability: When Algorithms Won't Help You. Note: Contents of today s lecture won t be on the exam
Limits to Approximability: When Algorithms Won't Help You Note: Contents of today s lecture won t be on the exam Outline Limits to Approximability: basic results Detour: Provers, verifiers, and NP Graph
More informationA An Overview of Complexity Theory for the Algorithm Designer
A An Overview of Complexity Theory for the Algorithm Designer A.1 Certificates and the class NP A decision problem is one whose answer is either yes or no. Two examples are: SAT: Given a Boolean formula
More informationComplexity Theory VU , SS The Polynomial Hierarchy. Reinhard Pichler
Complexity Theory Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 15 May, 2018 Reinhard
More informationOutline. Complexity Theory EXACT TSP. The Class DP. Definition. Problem EXACT TSP. Complexity of EXACT TSP. Proposition VU 181.
Complexity Theory Complexity Theory Outline Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität
More information8.5 Sequencing Problems
8.5 Sequencing Problems Basic genres. Packing problems: SET-PACKING, INDEPENDENT SET. Covering problems: SET-COVER, VERTEX-COVER. Constraint satisfaction problems: SAT, 3-SAT. Sequencing problems: HAMILTONIAN-CYCLE,
More informationMore on NP and Reductions
Indian Institute of Information Technology Design and Manufacturing, Kancheepuram Chennai 600 127, India An Autonomous Institute under MHRD, Govt of India http://www.iiitdm.ac.in COM 501 Advanced Data
More informationSubcubic Equivalences Between Path, Matrix, and Triangle Problems
Subcubic Equivalences Between Path, Matrix, and Triangle Problems Virginia Vassilevska Williams Ryan Williams Abstract We say an algorithm on n n matrices with entries in [ M,M] (or n-node graphs with
More informationMa/CS 6b Class 25: Error Correcting Codes 2
Ma/CS 6b Class 25: Error Correcting Codes 2 By Adam Sheffer Recall: Codes V n the set of binary sequences of length n. For example, V 3 = 000,001,010,011,100,101,110,111. Codes of length n are subsets
More informationLecture 10. Sublinear Time Algorithms (contd) CSC2420 Allan Borodin & Nisarg Shah 1
Lecture 10 Sublinear Time Algorithms (contd) CSC2420 Allan Borodin & Nisarg Shah 1 Recap Sublinear time algorithms Deterministic + exact: binary search Deterministic + inexact: estimating diameter in a
More informationSeparating Hierarchical and General Hub Labelings
Separating Hierarchical and General Hub Labelings Andrew V. Goldberg 1 Ilya Razenshteyn 2 Ruslan Savchenko 3 1 Microsoft Research Silicon Valley 2 CSAIL, MIT 3 Moscow State University June 23, 2013 Overview
More informationConnections between exponential time and polynomial time problem Lecture Notes for CS294
Connections between exponential time and polynomial time problem Lecture Notes for CS294 Lecturer: Russell Impagliazzo Scribe: Stefan Schneider November 10, 2015 We connect problems that have exponential
More informationThe Budget-Constrained Maximum Flow Problem
9 The Budget-Constrained Maximum Flow Problem In this chapter we consider the following problem which is called the constrained maximum flow problem ( Cmfp) [AO95]: We are given a budget B and we seek
More informationand e 2 ~ e 2 iff e 1
Section 4. Equivalence Relations A binary relation is an equivalence relation if it has the three properties reflexive, symmetric, and transitive (RST). Examples. a. Equality on any set. b. x ~ y iff x
More informationSpeeding up the Dreyfus-Wagner Algorithm for minimum Steiner trees
Speeding up the Dreyfus-Wagner Algorithm for minimum Steiner trees Bernhard Fuchs Center for Applied Computer Science Cologne (ZAIK) University of Cologne, Weyertal 80, 50931 Köln, Germany Walter Kern
More informationTheory of Computation CS3102 Spring 2014 A tale of computers, math, problem solving, life, love and tragic death
Theory of Computation CS3102 Spring 2014 A tale of computers, math, problem solving, life, love and tragic death Nathan Brunelle Department of Computer Science University of Virginia www.cs.virginia.edu/~njb2b/theory
More informationDivide and Conquer. Maximum/minimum. Median finding. CS125 Lecture 4 Fall 2016
CS125 Lecture 4 Fall 2016 Divide and Conquer We have seen one general paradigm for finding algorithms: the greedy approach. We now consider another general paradigm, known as divide and conquer. We have
More informationCombinatorial Optimization
Combinatorial Optimization Problem set 8: solutions 1. Fix constants a R and b > 1. For n N, let f(n) = n a and g(n) = b n. Prove that f(n) = o ( g(n) ). Solution. First we observe that g(n) 0 for all
More informationLecture 11. Single-Source Shortest Paths All-Pairs Shortest Paths
Lecture. Single-Source Shortest Paths All-Pairs Shortest Paths T. H. Cormen, C. E. Leiserson and R. L. Rivest Introduction to, rd Edition, MIT Press, 009 Sungkyunkwan University Hyunseung Choo choo@skku.edu
More informationCutting Plane Methods II
6.859/5.083 Integer Programming and Combinatorial Optimization Fall 2009 Cutting Plane Methods II Gomory-Chvátal cuts Reminder P = {x R n : Ax b} with A Z m n, b Z m. For λ [0, ) m such that λ A Z n, (λ
More informationPartitioning Metric Spaces
Partitioning Metric Spaces Computational and Metric Geometry Instructor: Yury Makarychev 1 Multiway Cut Problem 1.1 Preliminaries Definition 1.1. We are given a graph G = (V, E) and a set of terminals
More informationSingle Source Shortest Paths
CMPS 00 Fall 017 Single Source Shortest Paths Carola Wenk Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk Paths in graphs Consider a digraph G = (V, E) with an edge-weight
More informationWritten Qualifying Exam. Spring, Friday, May 22, This is nominally a three hour examination, however you will be
Written Qualifying Exam Theory of Computation Spring, 1998 Friday, May 22, 1998 This is nominally a three hour examination, however you will be allowed up to four hours. All questions carry the same weight.
More informationThe Knapsack Problem. 28. April /44
The Knapsack Problem 20 10 15 20 W n items with weight w i N and profit p i N Choose a subset x of items Capacity constraint i x w i W wlog assume i w i > W, i : w i < W Maximize profit i x p i 28. April
More informationORIE 6334 Spectral Graph Theory November 22, Lecture 25
ORIE 64 Spectral Graph Theory November 22, 206 Lecture 25 Lecturer: David P. Williamson Scribe: Pu Yang In the remaining three lectures, we will cover a prominent result by Arora, Rao, and Vazirani for
More informationHardness of Approximation
Hardness of Approximation We have seen several methods to find approximation algorithms for NP-hard problems We have also seen a couple of examples where we could show lower bounds on the achievable approxmation
More informationA Complexity Theory for Parallel Computation
A Complexity Theory for Parallel Computation The questions: What is the computing power of reasonable parallel computation models? Is it possible to make technology independent statements? Is it possible
More informationCographs; chordal graphs and tree decompositions
Cographs; chordal graphs and tree decompositions Zdeněk Dvořák September 14, 2015 Let us now proceed with some more interesting graph classes closed on induced subgraphs. 1 Cographs The class of cographs
More informationData Streams & Communication Complexity
Data Streams & Communication Complexity Lecture 1: Simple Stream Statistics in Small Space Andrew McGregor, UMass Amherst 1/25 Data Stream Model Stream: m elements from universe of size n, e.g., x 1, x
More informationCSE 431/531: Analysis of Algorithms. Dynamic Programming. Lecturer: Shi Li. Department of Computer Science and Engineering University at Buffalo
CSE 431/531: Analysis of Algorithms Dynamic Programming Lecturer: Shi Li Department of Computer Science and Engineering University at Buffalo Paradigms for Designing Algorithms Greedy algorithm Make a
More informationLecture 6 September 21, 2016
ICS 643: Advanced Parallel Algorithms Fall 2016 Lecture 6 September 21, 2016 Prof. Nodari Sitchinava Scribe: Tiffany Eulalio 1 Overview In the last lecture, we wrote a non-recursive summation program and
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 11 Luca Trevisan February 29, 2016
U.C. Berkeley CS294: Spectral Methods and Expanders Handout Luca Trevisan February 29, 206 Lecture : ARV In which we introduce semi-definite programming and a semi-definite programming relaxation of sparsest
More informationIntroduction to Algorithms
Introduction to Algorithms 6.046J/18.401J/SMA5503 Lecture 18 Prof. Erik Demaine Negative-weight cycles Recall: If a graph G = (V, E) contains a negativeweight cycle, then some shortest paths may not exist.
More informationReverse mathematics of some topics from algorithmic graph theory
F U N D A M E N T A MATHEMATICAE 157 (1998) Reverse mathematics of some topics from algorithmic graph theory by Peter G. C l o t e (Chestnut Hill, Mass.) and Jeffry L. H i r s t (Boone, N.C.) Abstract.
More informationLinear Time Selection
Linear Time Selection Given (x,y coordinates of N houses, where should you build road These lecture slides are adapted from CLRS.. Princeton University COS Theory of Algorithms Spring 0 Kevin Wayne Given
More informationCS 241 Analysis of Algorithms
CS 241 Analysis of Algorithms Professor Eric Aaron Lecture T Th 9:00am Lecture Meeting Location: OLB 205 Business Grading updates: HW5 back today HW7 due Dec. 10 Reading: Ch. 22.1-22.3, Ch. 25.1-2, Ch.
More informationScribes: Po-Hsuan Wei, William Kuzmaul Editor: Kevin Wu Date: October 18, 2016
CS 267 Lecture 7 Graph Spanners Scribes: Po-Hsuan Wei, William Kuzmaul Editor: Kevin Wu Date: October 18, 2016 1 Graph Spanners Our goal is to compress information about distances in a graph by looking
More informationAll-Pairs Shortest Paths
All-Pairs Shortest Paths Version of October 28, 2016 Version of October 28, 2016 All-Pairs Shortest Paths 1 / 26 Outline Another example of dynamic programming Will see two different dynamic programming
More informationImproved Quantum Algorithm for Triangle Finding via Combinatorial Arguments
Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments François Le Gall The University of Tokyo Technical version available at arxiv:1407.0085 [quant-ph]. Background. Triangle finding
More informationAlgorithms for Picture Analysis. Lecture 07: Metrics. Axioms of a Metric
Axioms of a Metric Picture analysis always assumes that pictures are defined in coordinates, and we apply the Euclidean metric as the golden standard for distance (or derived, such as area) measurements.
More information6.S078 A FINE-GRAINED APPROACH TO ALGORITHMS AND COMPLEXITY LECTURE 1
6.S078 A FINE-GRAINED APPROACH TO ALGORITHMS AND COMPLEXITY LECTURE 1 Not a requirement, but fun: OPEN PROBLEM Sessions!!! (more about this in a week) 6.S078 REQUIREMENTS 1. Class participation: worth
More informationOptimal Tree-decomposition Balancing and Reachability on Low Treewidth Graphs
Optimal Tree-decomposition Balancing and Reachability on Low Treewidth Graphs Krishnendu Chatterjee Rasmus Ibsen-Jensen Andreas Pavlogiannis IST Austria Abstract. We consider graphs with n nodes together
More informationDecompositions of graphs into cycles with chords
Decompositions of graphs into cycles with chords Paul Balister Hao Li Richard Schelp May 22, 2017 In memory of Dick Schelp, who passed away shortly after the submission of this paper Abstract We show that
More informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics Po-Shen Loh June 2009 1 Linear independence These problems both appeared in a course of Benny Sudakov at Princeton, but the links to Olympiad problems are due to Yufei
More informationComputability and Complexity
Computability and Complexity Complexity and Turing Machines. P vs NP Problem CAS 705 Ryszard Janicki Department of Computing and Software McMaster University Hamilton, Ontario, Canada janicki@mcmaster.ca
More informationCMPS 6610 Fall 2018 Shortest Paths Carola Wenk
CMPS 6610 Fall 018 Shortest Paths Carola Wenk Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk Paths in graphs Consider a digraph G = (V, E) with an edge-weight function w
More informationRECAP: Extremal problems Examples
RECAP: Extremal problems Examples Proposition 1. If G is an n-vertex graph with at most n edges then G is disconnected. A Question you always have to ask: Can we improve on this proposition? Answer. NO!
More informationDiscrete Optimization 2010 Lecture 8 Lagrangian Relaxation / P, N P and co-n P
Discrete Optimization 2010 Lecture 8 Lagrangian Relaxation / P, N P and co-n P Marc Uetz University of Twente m.uetz@utwente.nl Lecture 8: sheet 1 / 32 Marc Uetz Discrete Optimization Outline 1 Lagrangian
More informationAlgorithm Design and Analysis
Algorithm Design and Analysis LETURE 2 Network Flow Finish bipartite matching apacity-scaling algorithm Adam Smith 0//0 A. Smith; based on slides by E. Demaine,. Leiserson, S. Raskhodnikova, K. Wayne Marriage
More information1 Primals and Duals: Zero Sum Games
CS 124 Section #11 Zero Sum Games; NP Completeness 4/15/17 1 Primals and Duals: Zero Sum Games We can represent various situations of conflict in life in terms of matrix games. For example, the game shown
More informationGeometric Steiner Trees
Geometric Steiner Trees From the book: Optimal Interconnection Trees in the Plane By Marcus Brazil and Martin Zachariasen Part 3: Computational Complexity and the Steiner Tree Problem Marcus Brazil 2015
More informationDynamic Programming: Shortest Paths and DFA to Reg Exps
CS 374: Algorithms & Models of Computation, Spring 207 Dynamic Programming: Shortest Paths and DFA to Reg Exps Lecture 8 March 28, 207 Chandra Chekuri (UIUC) CS374 Spring 207 / 56 Part I Shortest Paths
More informationCS675: Convex and Combinatorial Optimization Fall 2016 Combinatorial Problems as Linear and Convex Programs. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Fall 2016 Combinatorial Problems as Linear and Convex Programs Instructor: Shaddin Dughmi Outline 1 Introduction 2 Shortest Path 3 Algorithms for Single-Source
More informationChapter 11. Approximation Algorithms. Slides by Kevin Wayne Pearson-Addison Wesley. All rights reserved.
Chapter 11 Approximation Algorithms Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights reserved. 1 P and NP P: The family of problems that can be solved quickly in polynomial time.
More informationCMPT 307 : Divide-and-Conqer (Study Guide) Should be read in conjunction with the text June 2, 2015
CMPT 307 : Divide-and-Conqer (Study Guide) Should be read in conjunction with the text June 2, 2015 1 Introduction The divide-and-conquer strategy is a general paradigm for algorithm design. This strategy
More informationTemporal Constraint Networks
Ch. 5b p.1/49 Temporal Constraint Networks Addition to Chapter 5 Ch. 5b p.2/49 Outline Temporal reasoning Qualitative networks The interval algebra The point algebra Quantitative temporal networks Reference:
More informationUC Berkeley CS 170: Efficient Algorithms and Intractable Problems Handout 22 Lecturer: David Wagner April 24, Notes 22 for CS 170
UC Berkeley CS 170: Efficient Algorithms and Intractable Problems Handout 22 Lecturer: David Wagner April 24, 2003 Notes 22 for CS 170 1 NP-completeness of Circuit-SAT We will prove that the circuit satisfiability
More informationCS311 Computational Structures. NP-completeness. Lecture 18. Andrew P. Black Andrew Tolmach. Thursday, 2 December 2010
CS311 Computational Structures NP-completeness Lecture 18 Andrew P. Black Andrew Tolmach 1 Some complexity classes P = Decidable in polynomial time on deterministic TM ( tractable ) NP = Decidable in polynomial
More informationSolutions to Exercises
1/13 Solutions to Exercises The exercises referred to as WS 1.1(a), and so forth, are from the course book: Williamson and Shmoys, The Design of Approximation Algorithms, Cambridge University Press, 2011,
More informationHardness for easy problems. An introduction
Hardness for easy problems An introduction The real world and hard problems I ve got data. I want to solve this algorithmic problem but I m stuck! Ok, thanks, I feel better that none of my attempts worked.
More informationA FINE-GRAINED APPROACH TO ALGORITHMS AND COMPLEXITY. Virginia Vassilevska Williams Stanford University
A FINE-GRAINED APPROACH TO ALGORITHMS AND COMPLEXITY Virginia Vassilevska Williams Stanford University THE CENTRAL QUESTION OF ALGORITHMS RESEARCH ``How fast can we solve fundamental problems, in the worst
More informationarxiv: v2 [cs.ds] 3 Oct 2017
Orthogonal Vectors Indexing Isaac Goldstein 1, Moshe Lewenstein 1, and Ely Porat 1 1 Bar-Ilan University, Ramat Gan, Israel {goldshi,moshe,porately}@cs.biu.ac.il arxiv:1710.00586v2 [cs.ds] 3 Oct 2017 Abstract
More informationFinding, Minimizing, and Counting Weighted Subgraphs
Finding, Minimizing, and Counting Weighted Subgraphs Virginia Vassilevska Williams Ryan Williams Abstract For a pattern graph H on k nodes, we consider the problems of finding and counting the number of
More information