Iterative Rounding and Relaxation


 Ralf Barber
 1 years ago
 Views:
Transcription
1 Iterative Rounding and Relaxation 1 / 58 Iterative Rounding and Relaxation James Davis Department of Computer Science Rutgers University Camden February 12, 2010
2 Iterative Rounding and Relaxation 2 / 58 Iterative Rounding and Relaxation Ingredients: Linear Program Theorem about individual variable values in LP solution Technique: Solve LP Round some variables Remove variables, relax constraints Iterate
3 Iterative Rounding and Relaxation 3 / 58 Brief History Survivable Network Design Jain (1998) MBDST Goemans (2006) Singh and Lau (2007, 2008) Bansal, Khandekar, Nagarajan (2008)
4 Iterative Rounding and Relaxation 4 / 58 Introduction: Vertex Cover Outline 1 Introduction: Vertex Cover 2 LP Formulation 3 Algorithm 4 Analysis Bounding Cost Bounding Degrees 5 Main Theorem Laminar Lemma Proof 6 Improvement
5 Iterative Rounding and Relaxation 5 / 58 Introduction: Vertex Cover Vertex Cover Input: A graph G = (V, E) Nonnegative costs on vertices c v Output: A minimumcost collection of vertices so that each edge in G is incident on at least one vertex in the collection
6 Iterative Rounding and Relaxation 6 / 58 Introduction: Vertex Cover Vertex Cover min v V c v x v x u + x v 1 e = (u, v) x v 0 v V
7 Iterative Rounding and Relaxation 7 / 58 Introduction: Vertex Cover Vertex Cover: Main Theorem Theorem (NemhauserTrotter) In a basic optimal LP solution, each x v { 1 2, 1, 0} Simple 2appx algorithm: Solve the Vertex Cover LP Include all vertices with x v 0 in our cover
8 Iterative Rounding and Relaxation 8 / 58 Introduction: Vertex Cover MBDST: Problem Statement Input: Output: A graph G = (V, E) Costs c e 0 for all e E A set W V Degree bounds b v for all v W Find a mincost spanning tree (V, F) that doesn t violate degree bounds.
9 Iterative Rounding and Relaxation 9 / 58 Introduction: Vertex Cover Example MST MBDST Cost = 3 Cost = 7
10 Iterative Rounding and Relaxation 10 / 58 LP Formulation Outline 1 Introduction: Vertex Cover 2 LP Formulation 3 Algorithm 4 Analysis Bounding Cost Bounding Degrees 5 Main Theorem Laminar Lemma Proof 6 Improvement
11 Iterative Rounding and Relaxation 11 / 58 LP Formulation MBDST Properties Notation: S: any subset of vertices E(S): edges with both endpoints in S F: set of edges in MBDST Properties: Spanning: Acyclic: Degree Bounds: Exactly V 1 edges in F For S 2, at most S 1 edges of F in E(S) At most b v edges of F incident on v
12 Iterative Rounding and Relaxation 12 / 58 LP Formulation Integer Program x e = 1 if e F and x e = 0 otherwise min c e x e (Objective) e E x e = V 1 (1) e E e E(S) e δ(v) x e S 1 S V, S 2 (2) x e b v v W (3) x e {0, 1} e E
13 Iterative Rounding and Relaxation 13 / 58 LP Formulation Linear Program x e = 1 if e F and x e = 0 otherwise min c e x e (Objective) e E x e = V 1 (1) e E e E(S) e δ(v) x e S 1 S V, S 2 (2) x e b v v W (3) x e 0 e E
14 Iterative Rounding and Relaxation 14 / 58 LP Formulation LP Properties There are exponentially many constraints (2) Ellipsoid method Separation oracle (1) and (3) are easy to check (2) requires work Skip Oracle
15 Iterative Rounding and Relaxation 15 / 58 LP Formulation Separation Oracle: Flow Network
16 Iterative Rounding and Relaxation 15 / 58 LP Formulation Separation Oracle: Flow Network s t
17 Iterative Rounding and Relaxation 15 / 58 LP Formulation Separation Oracle: Flow Network s t
18 Iterative Rounding and Relaxation 15 / 58 LP Formulation Separation Oracle: Flow Network s 1/2 1/2 1/2 3/ t
19 Iterative Rounding and Relaxation 15 / 58 LP Formulation Separation Oracle: Flow Network s 1/2 1/2 1/2 3/2 0 1\2 1/2 0 1/2 t
20 Iterative Rounding and Relaxation 15 / 58 LP Formulation Separation Oracle: Flow Network s 1/2 1/2 1/2 3/2 0 1\2 1/2 0 1/ t
21 Iterative Rounding and Relaxation 16 / 58 LP Formulation Separation Oracle:st cut Capacity =
22 Iterative Rounding and Relaxation 17 / 58 LP Formulation Separation Oracle The capacity across S is V + ( S 1) The capacity across S is at least V iff x e e E(S) e E(S) The maxflow from s to t is V iff (2) are satisfied x e S 1
23 Iterative Rounding and Relaxation 18 / 58 Algorithm Outline 1 Introduction: Vertex Cover 2 LP Formulation 3 Algorithm 4 Analysis Bounding Cost Bounding Degrees 5 Main Theorem Laminar Lemma Proof 6 Improvement
24 Iterative Rounding and Relaxation 19 / 58 Algorithm Main Theorem x =< x 1, x 2,..., x E >: solution to LP Support( x): set of edges s.t. x e > 0 Theorem For any basic solution x to the linear program either: 1 v with exactly one incident edge e Support( x) x e = 1 2 v W with at most 3 edges of Support( x) incident on v Condition 1 identifies a leaf in the tree Condition 2 identifies a vertex with sufficiently small number of nonzero incident edges
25 Iterative Rounding and Relaxation 20 / 58 Algorithm Algorithm F = While V > 1 x LP solution on < G, W > Remove all edges e with x e = 0 If condition 1 is satisfied by x Add (u, v) to F Remove v and (u, v) from G If u W reduce b u by 1 If condition 2 is satisfied by x Remove v from W
26 Iterative Rounding and Relaxation 21 / 58 Algorithm Linear Program min c e x e (Objective) e E x e = V 1 (1) e E e E(S) e δ(v) x e S 1 S V, S 2 (2) x e b v v W (3) x e 0 e E
27 Iterative Rounding and Relaxation 22 / 58 Algorithm LP Relationships In each iteration LP is in the same family Same separation oracle The Main Theorem applies to each LP If condition 1 is satisfied LP is incrementally modified: Delete an x e variable Modify (1) constraint Remove some (2) constraints Modify some (3) constraints If condition 2 is satisfied LP is incrementally modified: Remove a (3) constraint
28 Iterative Rounding and Relaxation 23 / 58 Analysis Outline 1 Introduction: Vertex Cover 2 LP Formulation 3 Algorithm 4 Analysis Bounding Cost Bounding Degrees 5 Main Theorem Laminar Lemma Proof 6 Improvement
29 Iterative Rounding and Relaxation 24 / 58 Analysis Bounding Cost Outline 1 Introduction: Vertex Cover 2 LP Formulation 3 Algorithm 4 Analysis Bounding Cost Bounding Degrees 5 Main Theorem Laminar Lemma Proof 6 Improvement
30 Iterative Rounding and Relaxation 25 / 58 Analysis Bounding Cost Bounding Cost Theorem The tree returned by our algorithm has cost at most LP OPT G' e 1 v IH: cost(f ) LP (G ) cost(f ) + c e LP (G ) + c e x e LP(G ) + c e x e LP: current lin. prog. LP : new lin. prog. F : MBDST in G = LP(G)
31 Iterative Rounding and Relaxation 26 / 58 Analysis Bounding Cost Bounding Cost Lemma LP(G ) is a feasible solution to LP (G ) Changes: 1 1 on RHS, 1 on LHS 2 Remove constraints 3 1 on RHS, 1 on LHS; Remove constraints x e = V 1 (1) e E e E(S) e δ(v) x e S 1 (2) x e b v (3)
32 Iterative Rounding and Relaxation 27 / 58 Analysis Bounding Cost MinCost Spanning Trees Recap: Spanning tree has optimal cost Degree bounds? Implications: Theorem For any basic solution x to the linear program either: 1 v with exactly one incident edge e Support( x) x e = 1 2 v W with at most 3 edges of Support( x) incident on v
33 Iterative Rounding and Relaxation 27 / 58 Analysis Bounding Cost MinCost Spanning Trees Recap: Spanning tree has optimal cost Degree bounds? Implications: Theorem For any basic solution x to the linear program either: 1 v with exactly one incident edge e Support( x) x e = 1 2 v W with at most 3 edges of Support( x) incident on v When W = we have OPT
34 Iterative Rounding and Relaxation 28 / 58 Analysis Bounding Degrees Outline 1 Introduction: Vertex Cover 2 LP Formulation 3 Algorithm 4 Analysis Bounding Cost Bounding Degrees 5 Main Theorem Laminar Lemma Proof 6 Improvement
35 Iterative Rounding and Relaxation 29 / 58 Analysis Bounding Degrees Degree Bounds u 1 b v, b u 1 b v never violated b u adjusted v Algorithm x LP solution on < G, W > Remove e / Support( x) If condition 1 is satisfied by x Add (u, v) to F Remove v and (u, v) from G If u W reduce b u by 1 If condition 2 is satisfied by x Remove v from W
36 Iterative Rounding and Relaxation 29 / 58 Analysis Bounding Degrees Degree Bounds 1 u b v, b u 1 b v never violated b u adjusted v Algorithm x LP solution on < G, W > Remove e / Support( x) If condition 1 is satisfied by x Add (u, v) to F Remove v and (u, v) from G If u W reduce b u by 1 If condition 2 is satisfied by x Remove v from W
37 Iterative Rounding and Relaxation 29 / 58 Analysis Bounding Degrees Degree Bounds 1/2 1/4 0 v 0 1/4 Algorithm x LP solution on < G, W > Remove e / Support( x) If condition 1 is satisfied by x Add (u, v) to F Remove v and (u, v) from G b v 1 All 3 edges may be in F b v violated by at most 2 If u W reduce b u by 1 If condition 2 is satisfied by x Remove v from W
38 Iterative Rounding and Relaxation 29 / 58 Analysis Bounding Degrees Degree Bounds 1/2 1/4 0 v 0 1/4 Algorithm x LP solution on < G, W > Remove e / Support( x) If condition 1 is satisfied by x Add (u, v) to F Remove v and (u, v) from G b v 1 All 3 edges may be in F b v violated by at most 2 If u W reduce b u by 1 If condition 2 is satisfied by x Remove v from W
39 Iterative Rounding and Relaxation 29 / 58 Analysis Bounding Degrees Degree Bounds v 0 1 Algorithm x LP solution on < G, W > Remove e / Support( x) If condition 1 is satisfied by x Add (u, v) to F Remove v and (u, v) from G b v 1 All 3 edges may be in F b v violated by at most 2 If u W reduce b u by 1 If condition 2 is satisfied by x Remove v from W
40 Iterative Rounding and Relaxation 30 / 58 Analysis Bounding Degrees Analysis Summary Cost: Tree has cost no more than OPT Degree Bounds: No degree bound violated by more than 2 Theorem (Goemans) The algorithm for MBDST produces a spanning tree in which the degree of v is at most b v + 2 for v W and has cost no greater than OPT
41 Iterative Rounding and Relaxation 31 / 58 Main Theorem Outline 1 Introduction: Vertex Cover 2 LP Formulation 3 Algorithm 4 Analysis Bounding Cost Bounding Degrees 5 Main Theorem Laminar Lemma Proof 6 Improvement
42 Iterative Rounding and Relaxation 32 / 58 Main Theorem Main Theorem Theorem For any basic solution x to the linear program either: 1 v with exactly one incident edge e Support( x) x e = 1 2 v W with at most 3 edges of Support( x) incident on v
43 Iterative Rounding and Relaxation 33 / 58 Main Theorem Linear Program min c e x e (Objective) e E x e = V 1 (1) e E e E(S) e δ(v) x e S 1 S V, S 2 (2) x e b v v W (3) x e 0 e E
44 Iterative Rounding and Relaxation 34 / 58 Main Theorem Laminar Lemma Lemma For any basic LP solution x there is a Z W and a collection L of S V where: 1 S L, S is tight; v Z, v is tight 2 The vectors χ E(S) and χ δ(v) are independent 3 L + Z = Support( x) 4 L is laminar
45 Iterative Rounding and Relaxation 35 / 58 Main Theorem Characteristic Vector χ E(S) =< 1, 1, 1, 0, 0, 0, 0 > 6 χ δ(v) =< 0, 1, 1, 0, 1, 0, 0 >
46 Iterative Rounding and Relaxation 36 / 58 Main Theorem Laminar Sets Intersecting Sets A B Laminar Sets No intersecting sets A B A B B A
47 Iterative Rounding and Relaxation 37 / 58 Main Theorem Laminar Lemma Lemma For any basic LP solution x there is a Z W and a collection L of S V where: 1 S L, S is tight; v Z, v is tight 2 The vectors χ E(S) and χ δ(v) are independent 3 L + Z = Support( x) 4 L is laminar
48 Iterative Rounding and Relaxation 38 / 58 Main Theorem Property of L Lemma If all S L contain at least 2 vertices then L V 1 Use induction on V Base case: V = 2 Induction step Shrink smallest set to vertex Generates L and V L is laminar L = L 1 V V 1 L V 1 L V 1
49 Iterative Rounding and Relaxation 38 / 58 Main Theorem Property of L Lemma If all S L contain at least 2 vertices then L V 1 Use induction on V Base case: V = 2 Induction step Shrink smallest set to vertex Generates L and V L is laminar L = L 1 V V 1 L V 1 L V 1
50 Iterative Rounding and Relaxation 39 / 58 Main Theorem Property of Support( x) Lemma Support( x) < V + W Recall property 3 of Laminar Lemma: L + Z = Support( x) Support( x) = L + Z L + W < V + W (Previous Lemma)
51 Iterative Rounding and Relaxation 40 / 58 Main Theorem From Laminar Lemma to Main Theorem Theorem For any basic solution x to the linear program either: 1 v with exactly one incident edge e Support( x) x e = 1 2 v W with at most 3 edges of Support( x) incident on v Suppose Main Theorem wasn t true: For every v V there are at least 2 edges incident on it For every v W there are at least 4 edges incident on it Support( x) 1 2 (2( V W ) + 4( W )) = V + W (Contradiction!)
52 Iterative Rounding and Relaxation 40 / 58 Main Theorem From Laminar Lemma to Main Theorem Theorem For any basic solution x to the linear program either: 1 v with exactly one incident edge e Support( x) x e = 1 2 v W with at most 3 edges of Support( x) incident on v Suppose Main Theorem wasn t true: For every v V there are at least 2 edges incident on it For every v W there are at least 4 edges incident on it Support( x) 1 2 (2( V W ) + 4( W )) = V + W (Contradiction!)
53 Iterative Rounding and Relaxation 40 / 58 Main Theorem From Laminar Lemma to Main Theorem Theorem For any basic solution x to the linear program either: 1 v with exactly one incident edge e Support( x) x e = 1 2 v W with at most 3 edges of Support( x) incident on v Suppose Main Theorem wasn t true: For every v V there are at least 2 edges incident on it For every v W there are at least 4 edges incident on it Support( x) 1 2 (2( V W ) + 4( W )) = V + W (Contradiction!)
54 Iterative Rounding and Relaxation 41 / 58 Main Theorem From Laminar Lemma to Main Theorem Theorem For any basic solution x to the linear program either: 1 v with exactly one incident edge e Support( x) x e = 1 2 v W with at most 3 edges of Support( x) incident on v v S=Vv e E(S) x e V 2 e E x e = V 1 e δ(v) x e 1 x e 1 x e 1 x e = 1
55 Iterative Rounding and Relaxation 41 / 58 Main Theorem From Laminar Lemma to Main Theorem Theorem For any basic solution x to the linear program either: 1 v with exactly one incident edge e Support( x) x e = 1 2 v W with at most 3 edges of Support( x) incident on v v S=Vv e E(S) x e V 2 e E x e = V 1 e δ(v) x e 1 x e 1 x e 1 x e = 1
56 Iterative Rounding and Relaxation 41 / 58 Main Theorem From Laminar Lemma to Main Theorem Theorem For any basic solution x to the linear program either: 1 v with exactly one incident edge e Support( x) x e = 1 2 v W with at most 3 edges of Support( x) incident on v v S=Vv e E(S) x e V 2 e E x e = V 1 e δ(v) x e 1 x e 1 x e 1 x e = 1
57 Iterative Rounding and Relaxation 41 / 58 Main Theorem From Laminar Lemma to Main Theorem Theorem For any basic solution x to the linear program either: 1 v with exactly one incident edge e Support( x) x e = 1 2 v W with at most 3 edges of Support( x) incident on v v S=Vv e E(S) x e V 2 e E x e = V 1 e δ(v) x e 1 x e 1 x e 1 x e = 1
58 Iterative Rounding and Relaxation 41 / 58 Main Theorem From Laminar Lemma to Main Theorem Theorem For any basic solution x to the linear program either: 1 v with exactly one incident edge e Support( x) x e = 1 2 v W with at most 3 edges of Support( x) incident on v u v S={u,v} e E(S) x e V 2 e E x e = V 1 e δ(v) x e 1 x e 1 x e 1 x e = 1
59 Iterative Rounding and Relaxation 42 / 58 Main Theorem Laminar Lemma Proof Outline 1 Introduction: Vertex Cover 2 LP Formulation 3 Algorithm 4 Analysis Bounding Cost Bounding Degrees 5 Main Theorem Laminar Lemma Proof 6 Improvement
60 Iterative Rounding and Relaxation 43 / 58 Main Theorem Laminar Lemma Proof Laminar Lemma Lemma For any basic LP solution x there is a Z W and a collection L of S V where: 1 S L, S is tight; v Z, v is tight 2 The vectors χ E(S) and χ δ(v) are independent 3 L + Z = Support( x) 4 L is laminar
61 Iterative Rounding and Relaxation 44 / 58 Main Theorem Laminar Lemma Proof LP Background min c i x i (Objective) a 11 x 1 + a 12 x a 1n x n b 1 (1) a 21 x 1 + a 22 x a 2n x n b 2 (2)... =... a m1 x 1 + a m2 x a mn x n b m (m) x i 0 (NonNegative)
62 Iterative Rounding and Relaxation 45 / 58 Main Theorem Laminar Lemma Proof LP Background Linear Program Constraints define halfspaces Objective is a hyperplane Solution always a corner n tight constraints Constraints lin. ind. min c i x i a 11 x 1 + a 12 x a 1n x n b 1 (1) a 21 x 1 + a 22 x a 2n x n b 2 (2)... =... a m1 x 1 + a m2 x a mnx n b m (m) x i 0
63 Iterative Rounding and Relaxation 45 / 58 Main Theorem Laminar Lemma Proof LP Background MBDST LP Constraints define halfspaces Objective is a hyperplane Solution always a corner E tight constraints Constraints lin. ind. min c ex e e E x e = V 1 (1) e E x e S 1 (2) e E(S) x e b v (3) e δ(v) x e 0
64 Iterative Rounding and Relaxation 46 / 58 Main Theorem Laminar Lemma Proof Laminar Lemma Lemma For any basic LP solution x there is a Z W and a collection L of S V where: 1 S L, S is tight; v Z, v is tight 2 The vectors χ E(S) and χ δ(v) are independent 3 L + Z = Support( x) 4 L is laminar
65 Iterative Rounding and Relaxation 46 / 58 Main Theorem Laminar Lemma Proof Laminar Lemma Lemma For any basic LP solution x there is a Z W and a collection L of S V where: 1 S L, S is tight; v Z, v is tight 2 The vectors χ E(S) and χ δ(v) are independent 3 L + Z = Support( x) 4 L is laminar
66 Iterative Rounding and Relaxation 47 / 58 Main Theorem Laminar Lemma Proof Laminar Lemma Proof Lemma e E(S) x e is supermodular e E(S) x e + e E(T ) x e e E(S T ) x e + e E(S T ) x e S T
67 Iterative Rounding and Relaxation 48 / 58 Main Theorem Laminar Lemma Proof Laminar Lemma Proof Lemma S, T are tight, S and T cross, then S T, S T are tight and χ E(S) + χ E(T ) = χ E(S T ) + χ E(S T ) ( S 1) + ( T 1) = ( S T 1) + ( S T 1) x e + (feasibility) E(S T ) E(S T ) x e x e + x e (supermodularity) E(S) E(T ) Since S and T are tight, these are all equalities
68 Iterative Rounding and Relaxation 49 / 58 Main Theorem Laminar Lemma Proof Laminar Lemma Proof: Finding L Lemma L that is laminar and Span(T ) Span(L), where T contains all tight sets Let L be a maximal laminar collection of T Recall that χ E(S) + χ E(T ) = χ E(S T ) + χ E(S T ) S T Span(T ) Span(L) S (least int. in L) T (int. S) S T and S T S T and S T S T S T S T S T
69 Iterative Rounding and Relaxation 49 / 58 Main Theorem Laminar Lemma Proof Laminar Lemma Proof: Finding L Lemma L that is laminar and Span(T ) Span(L), where T contains all tight sets Let L be a maximal laminar collection of T Recall that χ E(S) + χ E(T ) = χ E(S T ) + χ E(S T ) S T Span(T ) Span(L) S (least int. in L) T (int. S) S T and S T S T and S T S T S T S T S T
70 Iterative Rounding and Relaxation 49 / 58 Main Theorem Laminar Lemma Proof Laminar Lemma Proof: Finding L Lemma L that is laminar and Span(T ) Span(L), where T contains all tight sets Let L be a maximal laminar collection of T Recall that χ E(S) + χ E(T ) = χ E(S T ) + χ E(S T ) S T Span(T ) Span(L) S (least int. in L) T (int. S) S T and S T S T and S T S T S T S T S T
71 Iterative Rounding and Relaxation 49 / 58 Main Theorem Laminar Lemma Proof Laminar Lemma Proof: Finding L Lemma L that is laminar and Span(T ) Span(L), where T contains all tight sets Let L be a maximal laminar collection of T Recall that χ E(S) + χ E(T ) = χ E(S T ) + χ E(S T ) S T Span(T ) Span(L) S (least int. in L) T (int. S) S T and S T S T and S T S T S T S T S T
72 Iterative Rounding and Relaxation 49 / 58 Main Theorem Laminar Lemma Proof Laminar Lemma Proof: Finding L Lemma L that is laminar and Span(T ) Span(L), where T contains all tight sets Let L be a maximal laminar collection of T Recall that χ E(S) + χ E(T ) = χ E(S T ) + χ E(S T ) T Span(T ) Span(L) S (least int. in L) T (int. S) S T and S T S T and S T S T S T S T S T
73 Iterative Rounding and Relaxation 49 / 58 Main Theorem Laminar Lemma Proof Laminar Lemma Proof: Finding L Lemma L that is laminar and Span(T ) Span(L), where T contains all tight sets Let L be a maximal laminar collection of T Recall that χ E(S) + χ E(T ) = χ E(S T ) + χ E(S T ) T Span(T ) Span(L) S (least int. in L) T (int. S) S T and S T S T and S T S T S T S T S T
74 Iterative Rounding and Relaxation 50 / 58 Main Theorem Laminar Lemma Proof Laminar Lemma Proof: Finding Z Lemma For any basic LP solution x there is a Z W and a collection L of S V where: 1 S L, S is tight; v Z, v is tight 2 The vectors χ E(S) and χ δ(v) are independent 3 L + Z = Support( x) 4 L is laminar (T, Y ) spans R Support( x) (L, Y ) spans R Support( x) To obtain (L, Z ) remove v Y that are dependent
75 Iterative Rounding and Relaxation 51 / 58 Main Theorem Laminar Lemma Proof Recap LP formulation Main Theorem Algorithm Cost no more than OPT Degree bounds violated by at most 2 Main Theorem Proof Laminar Lemma Proof
76 Iterative Rounding and Relaxation 52 / 58 Improvement Outline 1 Introduction: Vertex Cover 2 LP Formulation 3 Algorithm 4 Analysis Bounding Cost Bounding Degrees 5 Main Theorem Laminar Lemma Proof 6 Improvement
77 Iterative Rounding and Relaxation 53 / 58 Improvement Improved Main Theorem Theorem If x is a basic solution to LP where W then there is a v, s.t. δ(v) Support( x) b v + 1
78 Iterative Rounding and Relaxation 54 / 58 Improvement Algorithm Phase 1: While W x LP solution on < G, W > For all x e = 0, remove e from E Remove v from W if there are at most b v + 1 edges of δ(v) in Support( x) Phase 2: Run algorithm on < G, >
79 Iterative Rounding and Relaxation 55 / 58 Improvement Analysis Theorem (Singh and Lau) The improved algorithm for MBDST produces a spanning tree in which the degree of v is at most b v + 1 for v W and has cost no greater than OPT
80 Iterative Rounding and Relaxation 56 / 58 Improvement References Kamal Jain. A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica, 21:3960, Michel X. Goemans. Minimum boundeddegree spanning trees. FOCS 06 Mohit Singh and Lap Chi Lau. Approximating minimum bounded degree spanning trees to within one of optimal. STOC 07.
81 Iterative Rounding and Relaxation 57 / 58 Improvement Acknowledgements Thanks to David Shmoys and David Williamson for letting us use the manuscript of their forthcoming book, The Design of Approximation Algorithms.
82 Iterative Rounding and Relaxation 58 / 58 Improvement Thank You! Return to Oracle
Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal ABSTACT Mohit Singh Tepper School of Business Carnegie Mellon University Pittsburgh, PA USA mohits@andrew.cmu.edu In the MINIMUM
More informationChapter 4. Trees. 4.1 Basics
Chapter 4 Trees 4.1 Basics A tree is a connected graph with no cycles. A forest is a collection of trees. A vertex of degree one, particularly in a tree, is called a leaf. Trees arise in a variety of applications.
More informationLecture 7: Approximation via Randomized Rounding
Lecture 7: Approximation via Randomized Rounding Often LPs return a fractional solution where the solution x, which is supposed to be in {0, } n, is in [0, ] n instead. There is a generic way of obtaining
More informationLecture 3: Linear Programming Relaxations and Rounding
Lecture 3: Linear Programming Relaxations and Rounding 1 Approximation Algorithms and Linear Relaxations For the time being, suppose we have a minimization problem. Many times, the problem at hand can
More information! Solve problem to optimality. ! Solve problem in polytime. ! Solve arbitrary instances of the problem. !approximation algorithm.
Approximation Algorithms Chapter Approximation Algorithms Q Suppose I need to solve an NPhard problem What should I do? A Theory says you're unlikely to find a polytime algorithm Must sacrifice one of
More information! Solve problem to optimality. ! Solve problem in polytime. ! Solve arbitrary instances of the problem. #approximation algorithm.
Approximation Algorithms 11 Approximation Algorithms Q Suppose I need to solve an NPhard problem What should I do? A Theory says you're unlikely to find a polytime algorithm Must sacrifice one of three
More information5.1 Bipartite Matching
CS787: Advanced Algorithms Lecture 5: Applications of Network Flow In the last lecture, we looked at the problem of finding the maximum flow in a graph, and how it can be efficiently solved using the FordFulkerson
More informationDefinition 11.1. Given a graph G on n vertices, we define the following quantities:
Lecture 11 The Lovász ϑ Function 11.1 Perfect graphs We begin with some background on perfect graphs. graphs. First, we define some quantities on Definition 11.1. Given a graph G on n vertices, we define
More informationChapter 11. 11.1 Load Balancing. Approximation Algorithms. Load Balancing. Load Balancing on 2 Machines. Load Balancing: Greedy Scheduling
Approximation Algorithms Chapter Approximation Algorithms Q. Suppose I need to solve an NPhard problem. What should I do? A. Theory says you're unlikely to find a polytime algorithm. Must sacrifice one
More informationApplied Algorithm Design Lecture 5
Applied Algorithm Design Lecture 5 Pietro Michiardi Eurecom Pietro Michiardi (Eurecom) Applied Algorithm Design Lecture 5 1 / 86 Approximation Algorithms Pietro Michiardi (Eurecom) Applied Algorithm Design
More informationMinimum Spanning Trees
Minimum Spanning Trees Algorithms and 18.304 Presentation Outline 1 Graph Terminology Minimum Spanning Trees 2 3 Outline Graph Terminology Minimum Spanning Trees 1 Graph Terminology Minimum Spanning Trees
More informationApproximation Algorithms
Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NPCompleteness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms
More information2.3 Scheduling jobs on identical parallel machines
2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed
More informationMath 443/543 Graph Theory Notes 4: Connector Problems
Math 443/543 Graph Theory Notes 4: Connector Problems David Glickenstein September 19, 2012 1 Trees and the Minimal Connector Problem Here is the problem: Suppose we have a collection of cities which we
More informationLinear Programming. Widget Factory Example. Linear Programming: Standard Form. Widget Factory Example: Continued.
Linear Programming Widget Factory Example Learning Goals. Introduce Linear Programming Problems. Widget Example, Graphical Solution. Basic Theory:, Vertices, Existence of Solutions. Equivalent formulations.
More informationMinimum Makespan Scheduling
Minimum Makespan Scheduling Minimum makespan scheduling: Definition and variants Factor 2 algorithm for identical machines PTAS for identical machines Factor 2 algorithm for unrelated machines Martin Zachariasen,
More informationAlgorithm Design and Analysis
Algorithm Design and Analysis LECTURE 27 Approximation Algorithms Load Balancing Weighted Vertex Cover Reminder: Fill out SRTEs online Don t forget to click submit Sofya Raskhodnikova 12/6/2011 S. Raskhodnikova;
More informationGRAPH THEORY and APPLICATIONS. Trees
GRAPH THEORY and APPLICATIONS Trees Properties Tree: a connected graph with no cycle (acyclic) Forest: a graph with no cycle Paths are trees. Star: A tree consisting of one vertex adjacent to all the others.
More information1 Polyhedra and Linear Programming
CS 598CSC: Combinatorial Optimization Lecture date: January 21, 2009 Instructor: Chandra Chekuri Scribe: Sungjin Im 1 Polyhedra and Linear Programming In this lecture, we will cover some basic material
More informationApproximation Algorithms: LP Relaxation, Rounding, and Randomized Rounding Techniques. My T. Thai
Approximation Algorithms: LP Relaxation, Rounding, and Randomized Rounding Techniques My T. Thai 1 Overview An overview of LP relaxation and rounding method is as follows: 1. Formulate an optimization
More informationAn Approximation Algorithm for Bounded Degree Deletion
An Approximation Algorithm for Bounded Degree Deletion Tomáš Ebenlendr Petr Kolman Jiří Sgall Abstract Bounded Degree Deletion is the following generalization of Vertex Cover. Given an undirected graph
More informationGood luck, veel succes!
Final exam Advanced Linear Programming, May 7, 13.0016.00 Switch off your mobile phone, PDA and any other mobile device and put it far away. No books or other reading materials are allowed. This exam
More informationDefinition of a Linear Program
Definition of a Linear Program Definition: A function f(x 1, x,..., x n ) of x 1, x,..., x n is a linear function if and only if for some set of constants c 1, c,..., c n, f(x 1, x,..., x n ) = c 1 x 1
More informationWeek 5 Integral Polyhedra
Week 5 Integral Polyhedra We have seen some examples 1 of linear programming formulation that are integral, meaning that every basic feasible solution is an integral vector. This week we develop a theory
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the
More informationONLINE DEGREEBOUNDED STEINER NETWORK DESIGN. Sina Dehghani Saeed Seddighin Ali Shafahi Fall 2015
ONLINE DEGREEBOUNDED STEINER NETWORK DESIGN Sina Dehghani Saeed Seddighin Ali Shafahi Fall 2015 ONLINE STEINER FOREST PROBLEM An initially given graph G. s 1 s 2 A sequence of demands (s i, t i ) arriving
More informationMinimize subject to. x S R
Chapter 12 Lagrangian Relaxation This chapter is mostly inspired by Chapter 16 of [1]. In the previous chapters, we have succeeded to find efficient algorithms to solve several important problems such
More informationInverse Optimization by James Orlin
Inverse Optimization by James Orlin based on research that is joint with Ravi Ahuja Jeopardy 000  the Math Programming Edition The category is linear objective functions The answer: When you maximize
More information11. APPROXIMATION ALGORITHMS
11. APPROXIMATION ALGORITHMS load balancing center selection pricing method: vertex cover LP rounding: vertex cover generalized load balancing knapsack problem Lecture slides by Kevin Wayne Copyright 2005
More informationCSL851: Algorithmic Graph Theory Semester I Lecture 4: August 5
CSL851: Algorithmic Graph Theory Semester I 201314 Lecture 4: August 5 Lecturer: Naveen Garg Scribes: Utkarsh Ohm Note: LaTeX template courtesy of UC Berkeley EECS dept. Disclaimer: These notes have not
More information5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1
5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 General Integer Linear Program: (ILP) min c T x Ax b x 0 integer Assumption: A, b integer The integrality condition
More informationA simpler and better derandomization of an approximation algorithm for Single Source RentorBuy
A simpler and better derandomization of an approximation algorithm for Single Source RentorBuy David P. Williamson Anke van Zuylen School of Operations Research and Industrial Engineering, Cornell University,
More informationPermutation Betting Markets: Singleton Betting with Extra Information
Permutation Betting Markets: Singleton Betting with Extra Information Mohammad Ghodsi Sharif University of Technology ghodsi@sharif.edu Hamid Mahini Sharif University of Technology mahini@ce.sharif.edu
More informationCIS 700: algorithms for Big Data
CIS 700: algorithms for Big Data Lecture 6: Graph Sketching Slides at http://grigory.us/bigdataclass.html Grigory Yaroslavtsev http://grigory.us Sketching Graphs? We know how to sketch vectors: v Mv
More informationPermutation Betting Markets: Singleton Betting with Extra Information
Permutation Betting Markets: Singleton Betting with Extra Information Mohammad Ghodsi Sharif University of Technology ghodsi@sharif.edu Hamid Mahini Sharif University of Technology mahini@ce.sharif.edu
More informationChapter 4: Trees. 2. Theorem: Let T be a graph with n vertices. Then the following statements are equivalent:
9 Properties of Trees. Definitions: Chapter 4: Trees forest  a graph that contains no cycles tree  a connected forest. Theorem: Let T be a graph with n vertices. Then the following statements are equivalent:
More informationCSL851: Algorithmic Graph Theory Semester I Lecture 1: July 24
CSL851: Algorithmic Graph Theory Semester I 20132014 Lecture 1: July 24 Lecturer: Naveen Garg Scribes: Suyash Roongta Note: LaTeX template courtesy of UC Berkeley EECS dept. Disclaimer: These notes have
More informationPlanar Graph and Trees
Dr. Nahid Sultana December 16, 2012 Tree Spanning Trees Minimum Spanning Trees Maps and Regions Eulers Formula Nonplanar graph Dual Maps and the Four Color Theorem Tree Spanning Trees Minimum Spanning
More informationConnectivity and cuts
Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every
More informationThe multiinteger set cover and the facility terminal cover problem
The multiinteger set cover and the facility teral cover problem Dorit S. Hochbaum Asaf Levin December 5, 2007 Abstract The facility teral cover problem is a generalization of the vertex cover problem.
More informationmax cx s.t. Ax c where the matrix A, cost vector c and right hand side b are given and x is a vector of variables. For this example we have x
Linear Programming Linear programming refers to problems stated as maximization or minimization of a linear function subject to constraints that are linear equalities and inequalities. Although the study
More informationprinceton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora
princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora Scribe: One of the running themes in this course is the notion of
More informationSolutions to Exercises 8
Discrete Mathematics Lent 2009 MA210 Solutions to Exercises 8 (1) Suppose that G is a graph in which every vertex has degree at least k, where k 1, and in which every cycle contains at least 4 vertices.
More information/ Approximation Algorithms Lecturer: Michael Dinitz Topic: Steiner Tree and TSP Date: 01/29/15 Scribe: Katie Henry
600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: Steiner Tree and TSP Date: 01/29/15 Scribe: Katie Henry 2.1 Steiner Tree Definition 2.1.1 In the Steiner Tree problem the input
More informationThe chromatic spectrum of mixed hypergraphs
The chromatic spectrum of mixed hypergraphs Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly Voloshin, Douglas B. West March 30, 2003 Abstract A mixed hypergraph is a triple H = (X, C, D), where X is the vertex
More information. P. 4.3 Basic feasible solutions and vertices of polyhedra. x 1. x 2
4. Basic feasible solutions and vertices of polyhedra Due to the fundamental theorem of Linear Programming, to solve any LP it suffices to consider the vertices (finitely many) of the polyhedron P of the
More informationMincost flow problems and network simplex algorithm
Mincost flow problems and network simplex algorithm The particular structure of some LP problems can be sometimes used for the design of solution techniques more efficient than the simplex algorithm.
More informationSteiner Tree Approximation via IRR. Randomized Rounding
Steiner Tree Approximation via Iterative Randomized Rounding Graduate Program in Logic, Algorithms and Computation μπλ Network Algorithms and Complexity June 18, 2013 Overview 1 Introduction Scope Related
More informationScheduling Shop Scheduling. Tim Nieberg
Scheduling Shop Scheduling Tim Nieberg Shop models: General Introduction Remark: Consider non preemptive problems with regular objectives Notation Shop Problems: m machines, n jobs 1,..., n operations
More informationLecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs
CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like
More informationAnswers to some of the exercises.
Answers to some of the exercises. Chapter 2. Ex.2.1 (a) There are several ways to do this. Here is one possibility. The idea is to apply the kcenter algorithm first to D and then for each center in D
More informationCHAPTER 9. Integer Programming
CHAPTER 9 Integer Programming An integer linear program (ILP) is, by definition, a linear program with the additional constraint that all variables take integer values: (9.1) max c T x s t Ax b and x integral
More informationChapter 3: Section 33 Solutions of Linear Programming Problems
Chapter 3: Section 33 Solutions of Linear Programming Problems D. S. Malik Creighton University, Omaha, NE D. S. Malik Creighton University, Omaha, NE Chapter () 3: Section 33 Solutions of Linear Programming
More informationNotes from Week 1: Algorithms for sequential prediction
CS 683 Learning, Games, and Electronic Markets Spring 2007 Notes from Week 1: Algorithms for sequential prediction Instructor: Robert Kleinberg 2226 Jan 2007 1 Introduction In this course we will be looking
More informationLecture 7  Linear Programming
COMPSCI 530: Design and Analysis of Algorithms DATE: 09/17/2013 Lecturer: Debmalya Panigrahi Lecture 7  Linear Programming Scribe: Hieu Bui 1 Overview In this lecture, we cover basics of linear programming,
More informationTheory of Linear Programming
Theory of Linear Programming Debasis Mishra April 6, 2011 1 Introduction Optimization of a function f over a set S involves finding the maximum (minimum) value of f (objective function) in the set S (feasible
More informationTHEORY OF SIMPLEX METHOD
Chapter THEORY OF SIMPLEX METHOD Mathematical Programming Problems A mathematical programming problem is an optimization problem of finding the values of the unknown variables x, x,, x n that maximize
More informationJianlin Cheng, PhD Computer Science Department University of Missouri, Columbia Fall, 2013
Jianlin Cheng, PhD Computer Science Department University of Missouri, Columbia Fall, 2013 Princeton s class notes on linear programming MIT s class notes on linear programming Xian Jiaotong University
More information6.042/18.062J Mathematics for Computer Science October 3, 2006 Tom Leighton and Ronitt Rubinfeld. Graph Theory III
6.04/8.06J Mathematics for Computer Science October 3, 006 Tom Leighton and Ronitt Rubinfeld Lecture Notes Graph Theory III Draft: please check back in a couple of days for a modified version of these
More informationForests and Trees: A forest is a graph with no cycles, a tree is a connected forest.
2 Trees What is a tree? Forests and Trees: A forest is a graph with no cycles, a tree is a connected forest. Theorem 2.1 If G is a forest, then comp(g) = V (G) E(G). Proof: We proceed by induction on E(G).
More informationTriangle deletion. Ernie Croot. February 3, 2010
Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,
More informationLecture 1: Course overview, circuits, and formulas
Lecture 1: Course overview, circuits, and formulas Topics in Complexity Theory and Pseudorandomness (Spring 2013) Rutgers University Swastik Kopparty Scribes: John Kim, Ben Lund 1 Course Information Swastik
More informationConstant Factor Approximation Algorithm for the Knapsack Median Problem
Constant Factor Approximation Algorithm for the Knapsack Median Problem Amit Kumar Abstract We give a constant factor approximation algorithm for the following generalization of the kmedian problem. We
More informationLecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method
Lecture 3 3B1B Optimization Michaelmas 2015 A. Zisserman Linear Programming Extreme solutions Simplex method Interior point method Integer programming and relaxation The Optimization Tree Linear Programming
More informationPlanarity Planarity
Planarity 8.1 71 Planarity Up until now, graphs have been completely abstract. In Topological Graph Theory, it matters how the graphs are drawn. Do the edges cross? Are there knots in the graph structure?
More informationInstitut für Informatik Lehrstuhl Theoretische Informatik I / Komplexitätstheorie. An Iterative Compression Algorithm for Vertex Cover
FriedrichSchillerUniversität Jena Institut für Informatik Lehrstuhl Theoretische Informatik I / Komplexitätstheorie Studienarbeit An Iterative Compression Algorithm for Vertex Cover von Thomas Peiselt
More informationLINEAR PROGRAMMING PROBLEM: A GEOMETRIC APPROACH
59 LINEAR PRGRAMMING PRBLEM: A GEMETRIC APPRACH 59.1 INTRDUCTIN Let us consider a simple problem in two variables x and y. Find x and y which satisfy the following equations x + y = 4 3x + 4y = 14 Solving
More informationGuessing Game: NPComplete?
Guessing Game: NPComplete? 1. LONGESTPATH: Given a graph G = (V, E), does there exists a simple path of length at least k edges? YES 2. SHORTESTPATH: Given a graph G = (V, E), does there exists a simple
More informationScheduling Home Health Care with Separating Benders Cuts in Decision Diagrams
Scheduling Home Health Care with Separating Benders Cuts in Decision Diagrams André Ciré University of Toronto John Hooker Carnegie Mellon University INFORMS 2014 Home Health Care Home health care delivery
More informationCharacterizations of Arboricity of Graphs
Characterizations of Arboricity of Graphs Ruth Haas Smith College Northampton, MA USA Abstract The aim of this paper is to give several characterizations for the following two classes of graphs: (i) graphs
More informationThe Graphical Simplex Method: An Example
The Graphical Simplex Method: An Example Consider the following linear program: Max 4x 1 +3x Subject to: x 1 +3x 6 (1) 3x 1 +x 3 () x 5 (3) x 1 +x 4 (4) x 1, x 0. Goal: produce a pair of x 1 and x that
More informationAdaptive Linear Programming Decoding
Adaptive Linear Programming Decoding Mohammad H. Taghavi and Paul H. Siegel ECE Department, University of California, San Diego Email: (mtaghavi, psiegel)@ucsd.edu ISIT 2006, Seattle, USA, July 9 14, 2006
More information1 Basic Definitions and Concepts in Graph Theory
CME 305: Discrete Mathematics and Algorithms 1 Basic Definitions and Concepts in Graph Theory A graph G(V, E) is a set V of vertices and a set E of edges. In an undirected graph, an edge is an unordered
More informationCS268: Geometric Algorithms Handout #5 Design and Analysis Original Handout #15 Stanford University Tuesday, 25 February 1992
CS268: Geometric Algorithms Handout #5 Design and Analysis Original Handout #15 Stanford University Tuesday, 25 February 1992 Original Lecture #6: 28 January 1991 Topics: Triangulating Simple Polygons
More informationCMPSCI611: Approximating MAXCUT Lecture 20
CMPSCI611: Approximating MAXCUT Lecture 20 For the next two lectures we ll be seeing examples of approximation algorithms for interesting NPhard problems. Today we consider MAXCUT, which we proved to
More informationInternational Doctoral School Algorithmic Decision Theory: MCDA and MOO
International Doctoral School Algorithmic Decision Theory: MCDA and MOO Lecture 2: Multiobjective Linear Programming Department of Engineering Science, The University of Auckland, New Zealand Laboratoire
More information3.1 Solving Systems Using Tables and Graphs
Algebra 2 Chapter 3 3.1 Solve Systems Using Tables & Graphs 3.1 Solving Systems Using Tables and Graphs A solution to a system of linear equations is an that makes all of the equations. To solve a system
More informationLinear Programming: Introduction
Linear Programming: Introduction Frédéric Giroire F. Giroire LP  Introduction 1/28 Course Schedule Session 1: Introduction to optimization. Modelling and Solving simple problems. Modelling combinatorial
More informationIntroduction to Algorithms Review information for Prelim 1 CS 4820, Spring 2010 Distributed Wednesday, February 24
Introduction to Algorithms Review information for Prelim 1 CS 4820, Spring 2010 Distributed Wednesday, February 24 The final exam will cover seven topics. 1. greedy algorithms 2. divideandconquer algorithms
More informationDefinition. A graph is a collection of vertices, and edges between them. They are often represented by a drawing:
1. GRAPHS AND COLORINGS Definition. A graph is a collection of vertices, and edges between them. They are often represented by a drawing: 3 vertices 3 edges 4 vertices 4 edges 4 vertices 6 edges A graph
More informationThe Geometric Structure of Spanning Trees and Applications to Multiobjective Optimization
The Geometric Structure of Spanning Trees and Applications to Multiobjective Optimization By ALLISON KELLY O HAIR SENIOR THESIS Submitted in partial satisfaction of the requirements for Highest Honors
More informationOutline. NPcompleteness. When is a problem easy? When is a problem hard? Today. Euler Circuits
Outline NPcompleteness Examples of Easy vs. Hard problems Euler circuit vs. Hamiltonian circuit Shortest Path vs. Longest Path 2pairs sum vs. general Subset Sum Reducing one problem to another Clique
More informationAnalysis of Algorithms, I
Analysis of Algorithms, I CSOR W4231.002 Eleni Drinea Computer Science Department Columbia University Thursday, February 26, 2015 Outline 1 Recap 2 Representing graphs 3 Breadthfirst search (BFS) 4 Applications
More information4 Basics of Trees. Petr Hliněný, FI MU Brno 1 FI: MA010: Trees and Forests
4 Basics of Trees Trees, actually acyclic connected simple graphs, are among the simplest graph classes. Despite their simplicity, they still have rich structure and many useful application, such as in
More informationGRAPH THEORY LECTURE 4: TREES
GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection
More informationSOLVING LINEAR SYSTEM OF INEQUALITIES WITH APPLICATION TO LINEAR PROGRAMS
SOLVING LINEAR SYSTEM OF INEQUALITIES WITH APPLICATION TO LINEAR PROGRAMS Hossein Arsham, University of Baltimore, (410) 8375268, harsham@ubalt.edu Veena Adlakha, University of Baltimore, (410) 8374969,
More informationDO NOT REDISTRIBUTE THIS SOLUTION FILE
Professor Kindred Math 04 Graph Theory Homework 7 Solutions April 3, 03 Introduction to Graph Theory, West Section 5. 0, variation of 5, 39 Section 5. 9 Section 5.3 3, 8, 3 Section 7. Problems you should
More informationThe Goldberg Rao Algorithm for the Maximum Flow Problem
The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }
More informationLecture Notes 6: Approximations for MAXSAT. 2 Notes about Weighted Vertex Cover Approximation
Algorithmic Methods //00 Lecture Notes 6: Approximations for MAXSAT Professor: Yossi Azar Scribe:Alon Ardenboim Introduction Although solving SAT is nown to be NPComplete, in this lecture we will cover
More informationCounting Spanning Trees
Counting Spanning Trees Bang Ye Wu KunMao Chao Counting Spanning Trees This book provides a comprehensive introduction to the modern study of spanning trees. A spanning tree for a graph G is a subgraph
More informationWhen is a graph planar?
When is a graph planar? Theorem(Euler, 1758) If a plane multigraph G with k components has n vertices, e edges, and f faces, then n e + f = 1 + k. Corollary If G is a simple, planar graph with n(g) 3,
More informationLinear Programming. March 14, 2014
Linear Programming March 1, 01 Parts of this introduction to linear programming were adapted from Chapter 9 of Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest and Stein [1]. 1
More informationLattice Point Geometry: Pick s Theorem and Minkowski s Theorem. Senior Exercise in Mathematics. Jennifer Garbett Kenyon College
Lattice Point Geometry: Pick s Theorem and Minkowski s Theorem Senior Exercise in Mathematics Jennifer Garbett Kenyon College November 18, 010 Contents 1 Introduction 1 Primitive Lattice Triangles 5.1
More information3 Does the Simplex Algorithm Work?
Does the Simplex Algorithm Work? In this section we carefully examine the simplex algorithm introduced in the previous chapter. Our goal is to either prove that it works, or to determine those circumstances
More informationMinimum cost maximum flow, Minimum cost circulation, Cost/Capacity scaling
6.854 Advanced Algorithms Lecture 16: 10/11/2006 Lecturer: David Karger Scribe: Kermin Fleming and Chris Crutchfield, based on notes by Wendy Chu and Tudor Leu Minimum cost maximum flow, Minimum cost circulation,
More informationBy W.E. Diewert. July, Linear programming problems are important for a number of reasons:
APPLIED ECONOMICS By W.E. Diewert. July, 3. Chapter : Linear Programming. Introduction The theory of linear programming provides a good introduction to the study of constrained maximization (and minimization)
More informationOn Competitiveness in Uniform Utility Allocation Markets
On Competitiveness in Uniform Utility Allocation Markets Deeparnab Chakrabarty Department of Combinatorics and Optimization University of Waterloo Nikhil Devanur Microsoft Research, Redmond, Washington,
More informationOptimization of Design. Lecturer:DungAn Wang Lecture 12
Optimization of Design Lecturer:DungAn Wang Lecture 12 Lecture outline Reading: Ch12 of text Today s lecture 2 Constrained nonlinear programming problem Find x=(x1,..., xn), a design variable vector of
More informationPlanar Tree Transformation: Results and Counterexample
Planar Tree Transformation: Results and Counterexample Selim G Akl, Kamrul Islam, and Henk Meijer School of Computing, Queen s University Kingston, Ontario, Canada K7L 3N6 Abstract We consider the problem
More informationTheorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that. a = bq + r and 0 r < b.
Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that a = bq + r and 0 r < b. We re dividing a by b: q is the quotient and r is the remainder,
More information