Maximum-Life Routing Schedule
|
|
- Rachel Doyle
- 6 years ago
- Views:
Transcription
1 Maximum-Life Routing Schedule Peng-Jun Wan Peng-Jun Wan Maximum-Life Routing Schedule 1 / 42
2 Outline Problem Description Min-Cost Routing Ellipsoid Algorithm Price-Directive Algorithm Flow-Based Algorithm Peng-Jun Wan Maximum-Life Routing Schedule 2 / 42
3 A Motivating Example 250 s u s u s 9 9 u (a) t 250 (b) t u (c) t Figure: Consider the unicast from s to t in (a). If only one path in either (b) or (c) is used, the life is 10. On the other hand, we can use both paths for 10 time units each to achieve an overall life of 20. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 3 / 42
4 Network model Communication topology: D = (V, A; c) Adjustable transmission power Power consumption: same as in the previous chapter Receiving power consumption is ignored Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 4 / 42
5 Communication Tasks Concurrent Unicasts Aggregation Broadcast Multicast Peng-Jun Wan Maximum-Life Routing Schedule 5 / 42
6 Communication Tasks Concurrent Unicasts Aggregation Broadcast Multicast R: a collection of routes for a given communication task Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 5 / 42
7 Routing Schedule b 2 R V +: energy budget function A routing schedule is a set of pairs (H i, x i ) 2 R R + for i = 1,, m satisfying that m p Hi (u) x i b (u), 8u 2 V. i=1 Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 6 / 42
8 Routing Schedule b 2 R V +: energy budget function A routing schedule is a set of pairs (H i, x i ) 2 R R + for i = 1,, m satisfying that m p Hi (u) x i b (u), 8u 2 V. i=1 The life (or length) of this schedule is m i=1 x i. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 6 / 42
9 Max-Life Routing Schedule Max-Life Routing Schedule (MLRS): nding a routing schedule of maximum life. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 7 / 42
10 Max-Life Routing Schedule Max-Life Routing Schedule (MLRS): nding a routing schedule of maximum life. max H 2R x H s.t. H 2R x H p H (u) b (u), 8u 2 V ; x H 0, 8H 2 R. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 7 / 42
11 Max-Life Routing Schedule Max-Life Routing Schedule (MLRS): nding a routing schedule of maximum life. max H 2R x H s.t. H 2R x H p H (u) b (u), 8u 2 V ; x H 0, 8H 2 R. jv j = n constraints ) 9 an optimal solution using at most n routes. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 7 / 42
12 Max-Life Routing Schedule Max-Life Routing Schedule (MLRS): nding a routing schedule of maximum life. max H 2R x H s.t. H 2R x H p H (u) b (u), 8u 2 V ; x H 0, 8H 2 R. jv j = n constraints ) 9 an optimal solution using at most n routes. # of variables jrj is exponential ) standard LP solvers are not practical. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 7 / 42
13 Summary on Algorithms Ellipsoid Algorithm (EA) Price-Directive Algorithm (PDA) Flow-Based Algorithm (FBA) EA PDA FBA Conc. Unicasts exact 1 + ε exact Aggregation exact 1 + ε exact Broadcast 2H (n 1) 1 (1 + ε) (2H (n 1) 1) N/A Multicast O (k ε ) O (k ε ) N/A Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 8 / 42
14 Roadmap Problem Description Min-Cost Routing Ellipsoid Algorithm Price-Directive Algorithm Flow-Based Algorithm Peng-Jun Wan Maximum-Life Routing Schedule 9 / 42
15 Min-Cost Routing y 2 R V +: a price function H: a subgraph of D cost of H w.r.t. y = y (u) p H (u) u2v Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 10 / 42
16 Min-Cost Routing y 2 R V +: a price function H: a subgraph of D cost of H w.r.t. y = y (u) p H (u) u2v Min-Cost Routing (MCR): nd an H 2 R of minimum cost w.r.t y. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 10 / 42
17 Min-Cost Routing y 2 R V +: a price function H: a subgraph of D cost of H w.r.t. y = y (u) p H (u) u2v Min-Cost Routing (MCR): nd an H 2 R of minimum cost w.r.t y. A generalization of Min-Power Routing Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 10 / 42
18 (Approximation) Algorithms for MCR By applying the algorithms developed in the previous chapter for MPR, we immediately have the following algorithmic results: 1 Concurrent Unicasts: polynomial 2 Aggregation: polynomial 3 Broadcast: (2H (n 1) 1)-approximation algorithm 4 Multicast: O (k ε )-approximation algorithm for any xed ε > 0 Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 11 / 42
19 MCR vs. Dual of MLRS Dual of MLRS: min s.t. u2v b (u) y (u) u2v p H (u) y (u) 1, 8H 2 R y (u) 0, 8u 2 V Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 12 / 42
20 MCR vs. Dual of MLRS Dual of MLRS: min s.t. u2v b (u) y (u) u2v p H (u) y (u) 1, 8H 2 R y (u) 0, 8u 2 V MCR: separation problem of the dual of MLRS Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 12 / 42
21 Max-Life vs. Min-Cost opt: life of a max-life routing schedule. For any price function y 2 R V +, let α (y) = min p H (u) y (u) : min-cost of routes in R w.r.t.y, H 2R u2v β (y) = b (u) y (u) : total energy cost w.r.t. y. u2v Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 13 / 42
22 Max-Life vs. Min-Cost opt: life of a max-life routing schedule. For any price function y 2 R V +, let α (y) = min p H (u) y (u) : min-cost of routes in R w.r.t.y, H 2R u2v β (y) = b (u) y (u) : total energy cost w.r.t. y. u2v Lemma For any y 2 R V +, α (y) β(y ) opt. In addition, there exists some y 2 RV + such that α (y) = β(y ) opt. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 13 / 42
23 Max-Life vs. Min-Cost First Part: Trivial if α (y) = 0. So, we assume that α (y) > 0. Then, is a feasible solution of the dual LP. Hence y opt β = β (y) β (y) ) α (y) α (y) α (y) opt. y α(y ) Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 14 / 42
24 Max-Life vs. Min-Cost First Part: Trivial if α (y) = 0. So, we assume that α (y) > 0. Then, is a feasible solution of the dual LP. Hence y opt β = β (y) β (y) ) α (y) α (y) α (y) opt. Second Part: Suppose y is an optimal solution to dual LP. Then, opt = β (y) and α (y) = 1 ) α (y) = β (y) opt. y α(y ) Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 14 / 42
25 Roadmap Problem Description Min-Cost Routing Ellipsoid Algorithm Price-Directive Algorithm Flow-Based Algorithm Peng-Jun Wan Maximum-Life Routing Schedule 15 / 42
26 Ellipsoid Method with (Approximate) Separation Oracle N : a network class Theorem Suppose that there is a polynomial (respectively, a polynomial µ-approximation) algorithm for MCR for a communication task restricted to N. Then, there is a polynomial (respectively, a polynomial µ-approximation) algorithm for MLRS for the same communication task restricted to N. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 16 / 42
27 Ellipsoid Algorithm for MLRS Ellipsoid Algorithm Conc. Unicasts exact Aggregation exact Broadcast 2H (n 1) 1 Multicast O (k ε ) Drawback: very slow practically Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 17 / 42
28 Roadmap Problem Description Min-Cost Routing Ellipsoid Algorithm Price-Directive Algorithm Flow-Based Algorithm Peng-Jun Wan Maximum-Life Routing Schedule 18 / 42
29 Basic Idea An iterative algorithm, in each iteration: Set the prices of the nodes with low residue energy relatively higher Nodes with low residue energy are protected from getting drained of energy quickly Nodes with high residue energy are enforced to contribute more energy Peng-Jun Wan Maximum-Life Routing Schedule 19 / 42
30 Basic Idea An iterative algorithm, in each iteration: Set the prices of the nodes with low residue energy relatively higher Nodes with low residue energy are protected from getting drained of energy quickly Nodes with high residue energy are enforced to contribute more energy Challenge: how to choose the prices properly? Peng-Jun Wan Maximum-Life Routing Schedule 19 / 42
31 Parameters A: a µ-approximation algorithm for MCR if µ = 1, the algorithm A is optimal for MCR ε: a constant parameter 2 (0, 1) output: an (1 + ε) µ-approximation. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 20 / 42
32 Variables H: the set of chosen routes; x H for each H 2 H: the duration of H; Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 21 / 42
33 Variables H: the set of chosen routes; x H for each H 2 H: the duration of H; z 2 R V +: the energy consumption percentage vector de ned by z (u) = H 2H x H p H (u), 8u 2 V ; b (u) φ: the maximum energy consumption percentage max u2v z (u); Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 21 / 42
34 Variables H: the set of chosen routes; x H for each H 2 H: the duration of H; z 2 R V +: the energy consumption percentage vector de ned by z (u) = H 2H x H p H (u), 8u 2 V ; b (u) φ: the maximum energy consumption percentage max u2v z (u); y 2 R V +: the price vector; β: the total energy cost u2v b (u) y (u). Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 21 / 42
35 Outline of PDA H ; 8u 2 V, z (u) 0; φ 0; 1 8u 2 V, y (u) b(u) ; β n; repeat compute an H 2 R using A on (D, y) ; t min v 2V b (v) /p H (v); if H 2 H then x H x H + t, else H H [ fhg and x H t; 8u 2 V, z (u) φ max u2v z (u) ; 8u 2 V, y (u) y (u) z (u) + t p H (u) b(u) ; β u2v b (u) y (u) ; until 0 < φ 1+ε ε ln β n ; Output f(h, x H /φ) : H 2 Hg. 1 + εt p H (u) b(u) ; Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 22 / 42
36 Running Time And Approximation Bound Theorem The algorithm l PDA produces m an (1 + ε) µ-approximation in at most K = n iterations. (1+ε) ln n (1+ε) ln(1+ε) ε Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 23 / 42
37 Running Time And Approximation Bound Theorem The algorithm l PDA produces m an (1 + ε) µ-approximation in at most K = n iterations. (1+ε) ln n (1+ε) ln(1+ε) ε PDA Conc. Unicasts 1 + ε Aggregation 1 + ε Broadcast (1 + ε) (2H (n 1) 1) Multicast O (k ε ) Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 23 / 42
38 Notations opt: life of an optimal solution Peng-Jun Wan Maximum-Life Routing Schedule 24 / 42
39 Notations opt: life of an optimal solution H 0, z 0, φ 0, y 0 and β 0 : initial values of H, z, φ, y and β resp. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 24 / 42
40 Notations opt: life of an optimal solution H 0, z 0, φ 0, y 0 and β 0 : initial values of H, z, φ, y and β resp. H j, z j, φ j, y j and β j : values of H, z, φ, y and β resp. at the end of the j-th iteration for each j 1 Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 24 / 42
41 Notations opt: life of an optimal solution H 0, z 0, φ 0, y 0 and β 0 : initial values of H, z, φ, y and β resp. H j, z j, φ j, y j and β j : values of H, z, φ, y and β resp. at the end of the j-th iteration for each j 1 H j : route selected in the j-th iteration Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 24 / 42
42 Notations opt: life of an optimal solution H 0, z 0, φ 0, y 0 and β 0 : initial values of H, z, φ, y and β resp. H j, z j, φ j, y j and β j : values of H, z, φ, y and β resp. at the end of the j-th iteration for each j 1 H j : route selected in the j-th iteration t j : value of t computed in the j-th iteration Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 24 / 42
43 Notations opt: life of an optimal solution H 0, z 0, φ 0, y 0 and β 0 : initial values of H, z, φ, y and β resp. H j, z j, φ j, y j and β j : values of H, z, φ, y and β resp. at the end of the j-th iteration for each j 1 H j : route selected in the j-th iteration t j : value of t computed in the j-th iteration τ j = max u2v y j (u) b (u): maximum energy cost of all nodes at the end of j-th iteration Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 24 / 42
44 Upper Bound on φ j Claim: φ j log 1+ε τ j for each j 1. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 25 / 42
45 Upper Bound on φ j Claim: φ j log 1+ε τ j for each j 1. Lemma For any ε > 0 and 0 t 1, t log 1+ε (1 + εt). Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 25 / 42
46 Upper Bound on φ j Claim: φ j log 1+ε τ j for each j 1. Lemma For any ε > 0 and 0 t 1, t log 1+ε (1 + εt). z j (u) z j 1 (u) log 1+ε (1 + ε (z j (u) z j 1 (u))) = log 1+ε y j (u) y j 1 (u), )z j (u) log 1+ε y j (u) y 0 (u) = log 1+ε (y j (u) b (u)) log 1+ε τ j. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 25 / 42
47 Running Time Prove by contradiction: assume > K iterations. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 26 / 42
48 Running Time Prove by contradiction: assume > K iterations. Among the rst K iterations some node v appears as a bottleneck node in at least K /n iterations. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 26 / 42
49 Running Time Prove by contradiction: assume > K iterations. Among the rst K iterations some node v appears as a bottleneck node in at least K /n iterations. In each of K /n iterations, y (v) is increased by a factor of 1 + ε. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 26 / 42
50 Running Time Prove by contradiction: assume > K iterations. Among the rst K iterations some node v appears as a bottleneck node in at least K /n iterations. In each of K /n iterations, y (v) is increased by a factor of 1 + ε. y K (v) y 0 (v) (1 + ε) K /n /n (1 + ε)k = b (v) ) τ K y k (v) b (v) (1 + ε) K /n ) φ K ln β K n log 1+ε τ K ln τ K n = 1 ln (1 + ε) ln n log 1+ε τ K 1 + ε ε Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 26 / 42
51 Running Time Prove by contradiction: assume > K iterations. Among the rst K iterations some node v appears as a bottleneck node in at least K /n iterations. In each of K /n iterations, y (v) is increased by a factor of 1 + ε. y K (v) y 0 (v) (1 + ε) K /n /n (1 + ε)k = b (v) ) τ K y k (v) b (v) (1 + ε) K /n ) φ K ln β K n log 1+ε τ K ln τ K n = 1 ln (1 + ε) ln n log 1+ε τ K 1 + ε ε By the stopping rule, the number of iterations K, which is a contradiction. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 26 / 42
52 Correctness of The output Solution k: number of iterations. Claim: By the end of the j-th iteration for 1 j k, the energy consumption percentage of each node u is z j (u), i.e., z j (u) = H 2H j x H p H (u), 8u 2 V. b (u) Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 27 / 42
53 Correctness of The output Solution k: number of iterations. Claim: By the end of the j-th iteration for 1 j k, the energy consumption percentage of each node u is z j (u), i.e., z j (u) = H 2H j x H p H (u), 8u 2 V. b (u) Therefore, the nal scaling by a factor φ k results in a feasible solution. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 27 / 42
54 Lower Bound on t j Claim: t j 1 β j β j 1 εµ β j 1 opt for each 1 j k, Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 28 / 42
55 Lower Bound on t j Claim: t j 1 β j β j 1 εµ β j 1 opt for each 1 j k, β j = b (u) y j (u) u2v = b (u) y j u2v 1 (u) 1 + εt j p Hj (u) b (u) = b (u) y j 1 (u) + εt j p Hj (u) y j u2v u2v = β j 1 + εt j p Hj (u) y j u2v β j 1 + εt j µ β j 1 opt. 1 (u)! 1 (u)! Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 28 / 42
56 Approximation Bound k t j opt k β j β j 1 j=1 εµ opt j=1 β j 1 εµ ln β k = opt β 0 εµ ln β k n, Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 29 / 42
57 Approximation Bound So, k t j opt k β j β j 1 j=1 εµ opt j=1 β j 1 εµ ln β k = opt β 0 εµ ln β k n, k j=1 t j 1 ln β k n opt 1 ε opt opt = φ k εµ φ k εµ 1 + ε (1 + ε) µ. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 29 / 42
58 Roadmap Problem Description Min-Cost Routing Ellipsoid Algorithm Price-Directive Algorithm Flow-Based Algorithm Peng-Jun Wan Maximum-Life Routing Schedule 30 / 42
59 Single Flow D = (V, A): a digraph with two distinct nodes s and t f 2 R A + is an s t ow in D if f δ out (v) = f δ in (v), 8v 2 V n fs, tg ( ow conservation law) s v1 2 v v 2 5 v 4 t Figure: An an s t ow of value 11. Value of f : val (f ) = f (δ out (s)) f δ in (s). Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 31 / 42
60 Single Flow D = (V, A): a digraph with two distinct nodes s and t f 2 R A + is an s t ow in D if f δ out (v) = f δ in (v), 8v 2 V n fs, tg ( ow conservation law) s v1 2 v v 2 5 v 4 t Figure: An an s t ow of value 11. Value of f : val (f ) = f (δ out (s)) f δ in (s). f is subject to an arc-capacity z 2 R A + if f z. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 31 / 42
61 Flow Decomposition s 6 v 1 2 v v 2 5 v 4 (a) 6 t s 5 v 2 5 (b) v 4 5 t s 6 v 2 1 v t s v 1 2 v t (c) v 4 (d) s v 1 v t (e) v 4 Figure: Any s t ow of value L can be decomposed into at most jaj s t paths of total value L and possibly some circuits. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 32 / 42
62 Maximum Flow Maximum Flow: nding an s t ow f subject to a given arc-capacity z 2 R A + such that val (f ) is maximized. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 33 / 42
63 Maximum Flow Maximum Flow: nding an s t ow f subject to a given arc-capacity z 2 R A + such that val (f ) is maximized. Solvable in polynomial time by ow-augmentation algorithms. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 33 / 42
64 Multi ow Given k commodities with s i, t i being the source and sink, resp., for commodity i. F i : the set of s i t i ows. A k- ow is a sequence hf 1, f 2,, f k i with f i 2 F i 81 i k. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 34 / 42
65 Multi ow Given k commodities with s i, t i being the source and sink, resp., for commodity i. F i : the set of s i t i ows. A k- ow is a sequence hf 1, f 2,, f k i with f i 2 F i 81 i k. A k- ow hf 1, f 2,, f k i is subject to an arc-capacity z 2 R A + if k i=1 f i z. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 34 / 42
66 Maximum Concurrent Multi ow max s.t. L f i 2 F i, 81 i k val (f i ) = L, 81 i k k i=1 f i z Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 35 / 42
67 Concurrent Unicasts Given k unicasts are treated as k commodities. A k- ow hf 1, f 2,, f k i is subject to an energy budget b 2 R V + if c (e) e2δ out (v )! k f i (e) b (v), 8v 2 V. i=1 Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 36 / 42
68 Concurrent Unicasts Given k unicasts are treated as k commodities. A k- ow hf 1, f 2,, f k i is subject to an energy budget b 2 R V + if c (e) e2δ out (v )! k f i (e) b (v), 8v 2 V. i=1 MLRS corresponds to maximum concurrent multi ow subject to energy budget b Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 36 / 42
69 MLRS for Concurrent Unicasts Step 1: Solve the LP max s.t. L f i 2 F i, 81 i k val (f i ) = L, 81 i k e2δ out (v ) c (e) k i=1 f i (e) b (v), 8v 2 V Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 37 / 42
70 MLRS for Concurrent Unicasts Step 1: Solve the LP max s.t. L f i 2 F i, 81 i k val (f i ) = L, 81 i k e2δ out (v ) c (e) k i=1 f i (e) b (v), 8v 2 V Step 2: Decompose each f i into at most jaj s i t i paths of total value L and discarding the rest circuits if there is any. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 37 / 42
71 Fractional Arborescence Packing D = (V, A): a digraph with a root node s T : collection of spanning arborescences rooted at s A fractional s-arborescence packing in D subject to given arc-capacity z 2 R A + is a set of k pairs (T j, λ j ) 2 T R + satisfying that 1jk,e2T j λ j z (e), 8e 2 A. The value of this packing is k j=1 λ j. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 38 / 42
72 Maximum Fractional Arborescence Packing Maximum Fractional Arborescence Packing: nding a fractional s-arborescence packing in D subject to a given arc-capacity z 2 R A + whose value is is maximized. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 39 / 42
73 Maximum Fractional Arborescence Packing Maximum Fractional Arborescence Packing: nding a fractional s-arborescence packing in D subject to a given arc-capacity z 2 R A + whose value is is maximized. Gabow-Manu algorithm a greedy algorithm using at most jaj spanning s-arborescences. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 39 / 42
74 A Min-Max Relation m ow (u, z): the value of a maximum s u ow in D subject to z, 8u 2 V n fsg Theorem The value of a maximum fractional s-arborescence packing in D subject to z is equal to min m ow (u, z). u2v nfsg Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 40 / 42
75 MLRS for Aggregation Step 1: Compute an optimal arc-capacity z 2 R A + by solving the LP: max s.t. L e2δ out (v ) c (e) z (e) b (v), 8v 2 V val (f u ) = L, 8u 2 V n fsg f u 2 F u, 8u 2 V n fsg f u z, 8u 2 V n fsg Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 41 / 42
76 MLRS for Aggregation Step 1: Compute an optimal arc-capacity z 2 R A + by solving the LP: max s.t. L e2δ out (v ) c (e) z (e) b (v), 8v 2 V val (f u ) = L, 8u 2 V n fsg f u 2 F u, 8u 2 V n fsg f u z, 8u 2 V n fsg Step 2: Compute a maximum fractional packing of spanning inward s-arborescences subject to z using the Gabow-Manu algorithm. Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 41 / 42
77 Correctness opt: life of a max-life routing schedule L: the value of the LP in Step 1 Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 42 / 42
78 Correctness opt: life of a max-life routing schedule L: the value of the LP in Step 1 Then, 1 opt L Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 42 / 42
79 Correctness opt: life of a max-life routing schedule L: the value of the LP in Step 1 Then, 1 opt L 2 the life of the output solution in Step 2 L by the min-max relation, Peng-Jun Wan (wan@cs.iit.edu) Maximum-Life Routing Schedule 42 / 42
Wireless Coverage with Disparate Ranges
Wireless Coverage with Disparate Ranges Peng-Jun Wan, Xiaohua Xu, Zhu Wang Department of Computer Science Illinois Institute of Technology Chicago, I 6066 wan@cs.iit.edu, xxu23@iit.edu, zwang59@iit.edu
More informationCS599: Convex and Combinatorial Optimization Fall 2013 Lecture 17: Combinatorial Problems as Linear Programs III. Instructor: Shaddin Dughmi
CS599: Convex and Combinatorial Optimization Fall 2013 Lecture 17: Combinatorial Problems as Linear Programs III Instructor: Shaddin Dughmi Announcements Today: Spanning Trees and Flows Flexibility awarded
More informationMinimum Latency Link Scheduling under Protocol Interference Model
Minimum Latency Link Scheduling under Protocol Interference Model Peng-Jun Wan wan@cs.iit.edu Peng-Jun Wan (wan@cs.iit.edu) Minimum Latency Link Scheduling under Protocol Interference Model 1 / 31 Outline
More informationApproximating Minimum-Power Degree and Connectivity Problems
Approximating Minimum-Power Degree and Connectivity Problems Guy Kortsarz Vahab S. Mirrokni Zeev Nutov Elena Tsanko Abstract Power optimization is a central issue in wireless network design. Given a graph
More informationMinimum cost transportation problem
Minimum cost transportation problem Complements of Operations Research Giovanni Righini Università degli Studi di Milano Definitions The minimum cost transportation problem is a special case of the minimum
More informationAgenda. Soviet Rail Network, We ve done Greedy Method Divide and Conquer Dynamic Programming
Agenda We ve done Greedy Method Divide and Conquer Dynamic Programming Now Flow Networks, Max-flow Min-cut and Applications c Hung Q. Ngo (SUNY at Buffalo) CSE 531 Algorithm Analysis and Design 1 / 52
More informationLecture #21. c T x Ax b. maximize subject to
COMPSCI 330: Design and Analysis of Algorithms 11/11/2014 Lecture #21 Lecturer: Debmalya Panigrahi Scribe: Samuel Haney 1 Overview In this lecture, we discuss linear programming. We first show that the
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 informationNotes on Dantzig-Wolfe decomposition and column generation
Notes on Dantzig-Wolfe decomposition and column generation Mette Gamst November 11, 2010 1 Introduction This note introduces an exact solution method for mathematical programming problems. The method is
More informationMathematics for Decision Making: An Introduction. Lecture 13
Mathematics for Decision Making: An Introduction Lecture 13 Matthias Köppe UC Davis, Mathematics February 17, 2009 13 1 Reminder: Flows in networks General structure: Flows in networks In general, consider
More informationAlgorithms for multiplayer multicommodity ow problems
Noname manuscript No. (will be inserted by the editor) Algorithms for multiplayer multicommodity ow problems Attila Bernáth Tamás Király Erika Renáta Kovács Gergely Mádi-Nagy Gyula Pap Júlia Pap Jácint
More informationCS675: Convex and Combinatorial Optimization Fall 2014 Combinatorial Problems as Linear Programs. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Fall 2014 Combinatorial Problems as Linear Programs Instructor: Shaddin Dughmi Outline 1 Introduction 2 Shortest Path 3 Algorithms for Single-Source Shortest
More informationGRAPH ALGORITHMS Week 7 (13 Nov - 18 Nov 2017)
GRAPH ALGORITHMS Week 7 (13 Nov - 18 Nov 2017) C. Croitoru croitoru@info.uaic.ro FII November 12, 2017 1 / 33 OUTLINE Matchings Analytical Formulation of the Maximum Matching Problem Perfect Matchings
More informationThe Steiner Network Problem
The Steiner Network Problem Pekka Orponen T-79.7001 Postgraduate Course on Theoretical Computer Science 7.4.2008 Outline 1. The Steiner Network Problem Linear programming formulation LP relaxation 2. The
More informationto t in the graph with capacities given by u e + i(e) for edges e is maximized. We further distinguish the problem MaxFlowImp according to the valid v
Flow Improvement and Network Flows with Fixed Costs S. O. Krumke, Konrad-Zuse-Zentrum fur Informationstechnik Berlin H. Noltemeier, S. Schwarz, H.-C. Wirth, Universitat Wurzburg R. Ravi, Carnegie Mellon
More informationLecture 3. 1 Polynomial-time algorithms for the maximum flow problem
ORIE 633 Network Flows August 30, 2007 Lecturer: David P. Williamson Lecture 3 Scribe: Gema Plaza-Martínez 1 Polynomial-time algorithms for the maximum flow problem 1.1 Introduction Let s turn now to considering
More informationu = 50 u = 30 Generalized Maximum Flow Problem s u = 00 2 u = 00 u = 50 4 = 3=4 u = 00 t capacity u = 20 3 u = 20 = =2 5 u = 00 gain/loss factor Max o
Generalized Max Flows Kevin Wayne Cornell University www.orie.cornell.edu/~wayne = 3=4 40 v w 30 advisor: Eva Tardos u = 50 u = 30 Generalized Maximum Flow Problem s u = 00 2 u = 00 u = 50 4 = 3=4 u =
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 informationCDS in Plane Geometric Networks: Short, Small, And Sparse
CDS in Plane Geometric Networks: Short, Small, And Sparse Peng-Jun Wan Peng-Jun Wan () CDS in Plane Geometric Networks: Short, Small, And Sparse 1 / 38 Outline Three Parameters of CDS Dominators Basic
More informationThe min cost flow problem Course notes for Optimization Spring 2007
The min cost flow problem Course notes for Optimization Spring 2007 Peter Bro Miltersen February 7, 2007 Version 3.0 1 Definition of the min cost flow problem We shall consider a generalization of the
More informationThe min cost flow problem Course notes for Search and Optimization Spring 2004
The min cost flow problem Course notes for Search and Optimization Spring 2004 Peter Bro Miltersen February 20, 2004 Version 1.3 1 Definition of the min cost flow problem We shall consider a generalization
More information6.854 Advanced Algorithms
6.854 Advanced Algorithms Homework 5 Solutions 1 10 pts Define the following sets: P = positions on the results page C = clicked old results U = unclicked old results N = new results and let π : (C U)
More informationRunning Time. Assumption. All capacities are integers between 1 and C.
Running Time Assumption. All capacities are integers between and. Invariant. Every flow value f(e) and every residual capacities c f (e) remains an integer throughout the algorithm. Theorem. The algorithm
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 informationPacking Arborescences
Egerváry Research Group on Combinatorial Optimization Technical reports TR-2009-04. Published by the Egerváry Research Group, Pázmány P. sétány 1/C, H1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.
More information7. Lecture notes on the ellipsoid algorithm
Massachusetts Institute of Technology Michel X. Goemans 18.433: Combinatorial Optimization 7. Lecture notes on the ellipsoid algorithm The simplex algorithm was the first algorithm proposed for linear
More informationLinear Programming. Jie Wang. University of Massachusetts Lowell Department of Computer Science. J. Wang (UMass Lowell) Linear Programming 1 / 47
Linear Programming Jie Wang University of Massachusetts Lowell Department of Computer Science J. Wang (UMass Lowell) Linear Programming 1 / 47 Linear function: f (x 1, x 2,..., x n ) = n a i x i, i=1 where
More informationOn shredders and vertex connectivity augmentation
On shredders and vertex connectivity augmentation Gilad Liberman The Open University of Israel giladliberman@gmail.com Zeev Nutov The Open University of Israel nutov@openu.ac.il Abstract We consider the
More informationLecture 13: Polynomial-Time Algorithms for Min Cost Flows. (Reading: AM&O Chapter 10)
Lecture 1: Polynomial-Time Algorithms for Min Cost Flows (Reading: AM&O Chapter 1) Polynomial Algorithms for Min Cost Flows Improvements on the two algorithms for min cost flow: Successive Shortest Path
More informationMulticommodity Flows and Column Generation
Lecture Notes Multicommodity Flows and Column Generation Marc Pfetsch Zuse Institute Berlin pfetsch@zib.de last change: 2/8/2006 Technische Universität Berlin Fakultät II, Institut für Mathematik WS 2006/07
More informationC&O 355 Mathematical Programming Fall 2010 Lecture 18. N. Harvey
C&O 355 Mathematical Programming Fall 2010 Lecture 18 N. Harvey Network Flow Topics Max Flow / Min Cut Theorem Total Unimodularity Directed Graphs & Incidence Matrices Proof of Max Flow / Min Cut Theorem
More informationCMPSCI 611: Advanced Algorithms
CMPSCI 611: Advanced Algorithms Lecture 12: Network Flow Part II Andrew McGregor Last Compiled: December 14, 2017 1/26 Definitions Input: Directed Graph G = (V, E) Capacities C(u, v) > 0 for (u, v) E and
More informationVISUALIZING, FINDING AND PACKING DIJOINS
Chapter 1 VISUALIZING, FINDING AND PACKING DIJOINS F. B. Shepherd Math Sciences, Bell Laboratories. bshep@research.bell-labs.com A. Vetta Dept. of Mathematics & Statistics, and School of Computer Science,
More informationRestricted b-matchings in degree-bounded graphs
Egerváry Research Group on Combinatorial Optimization Technical reports TR-009-1. Published by the Egerváry Research Group, Pázmány P. sétány 1/C, H1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.
More informationAlgorithms and Theory of Computation. Lecture 11: Network Flow
Algorithms and Theory of Computation Lecture 11: Network Flow Xiaohui Bei MAS 714 September 18, 2018 Nanyang Technological University MAS 714 September 18, 2018 1 / 26 Flow Network A flow network is a
More informationLogic-based Benders Decomposition
Logic-based Benders Decomposition A short Introduction Martin Riedler AC Retreat Contents 1 Introduction 2 Motivation 3 Further Notes MR Logic-based Benders Decomposition June 29 July 1 2 / 15 Basic idea
More informationOutline. Relaxation. Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING. 1. Lagrangian Relaxation. Lecture 12 Single Machine Models, Column Generation
Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING 1. Lagrangian Relaxation Lecture 12 Single Machine Models, Column Generation 2. Dantzig-Wolfe Decomposition Dantzig-Wolfe Decomposition Delayed Column
More informationAn algorithm to increase the node-connectivity of a digraph by one
Discrete Optimization 5 (2008) 677 684 Contents lists available at ScienceDirect Discrete Optimization journal homepage: www.elsevier.com/locate/disopt An algorithm to increase the node-connectivity of
More informationNetwork Flows. 7. Multicommodity Flows Problems. Fall 2010 Instructor: Dr. Masoud Yaghini
In the name of God Network Flows 7. Multicommodity Flows Problems 7.3 Column Generation Approach Fall 2010 Instructor: Dr. Masoud Yaghini Path Flow Formulation Path Flow Formulation Let first reformulate
More informationCable Trench Problem
Cable Trench Problem Matthew V Galati Ted K Ralphs Joseph C Hartman magh@lehigh.edu Department of Industrial and Systems Engineering Lehigh University, Bethlehem, PA Cable Trench Problem p.1 Cable Trench
More informationMultiflows in Multi-Channel Multi-Radio Multihop Wireless Networks
This paper was presented as part of the main technical program at IEEE INFOCOM 2011 Multiflows in Multi-Channel Multi-Radio Multihop Wireless Networks Peng-Jun Wan, Yu Cheng, Zhu Wang and Frances Yao Department
More informationRobust Network Codes for Unicast Connections: A Case Study
Robust Network Codes for Unicast Connections: A Case Study Salim Y. El Rouayheb, Alex Sprintson, and Costas Georghiades Department of Electrical and Computer Engineering Texas A&M University College Station,
More informationdirected weighted graphs as flow networks the Ford-Fulkerson algorithm termination and running time
Network Flow 1 The Maximum-Flow Problem directed weighted graphs as flow networks the Ford-Fulkerson algorithm termination and running time 2 Maximum Flows and Minimum Cuts flows and cuts max flow equals
More informationOn the Approximate Linear Programming Approach for Network Revenue Management Problems
On the Approximate Linear Programming Approach for Network Revenue Management Problems Chaoxu Tong School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853,
More informationTechnische Universität München, Zentrum Mathematik Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik. Combinatorial Optimization (MA 4502)
Technische Universität München, Zentrum Mathematik Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik Combinatorial Optimization (MA 4502) Dr. Michael Ritter Problem Sheet 1 Homework Problems Exercise
More informationOutline. Outline. Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING. 1. Scheduling CPM/PERT Resource Constrained Project Scheduling Model
Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING Lecture 3 and Mixed Integer Programg Marco Chiarandini 1. Resource Constrained Project Model 2. Mathematical Programg 2 Outline Outline 1. Resource Constrained
More informationResource Constrained Project Scheduling Linear and Integer Programming (1)
DM204, 2010 SCHEDULING, TIMETABLING AND ROUTING Lecture 3 Resource Constrained Project Linear and Integer Programming (1) Marco Chiarandini Department of Mathematics & Computer Science University of Southern
More information3.4 Relaxations and bounds
3.4 Relaxations and bounds Consider a generic Discrete Optimization problem z = min{c(x) : x X} with an optimal solution x X. In general, the algorithms generate not only a decreasing sequence of upper
More informationDistributed Distance-Bounded Network Design Through Distributed Convex Programming
Distributed Distance-Bounded Network Design Through Distributed Convex Programming OPODIS 2017 Michael Dinitz, Yasamin Nazari Johns Hopkins University December 18, 2017 Distance Bounded Network Design
More informationEfficient Primal- Dual Graph Algorithms for Map Reduce
Efficient Primal- Dual Graph Algorithms for Map Reduce Joint work with Bahman Bahmani Ashish Goel, Stanford Kamesh Munagala Duke University Modern Data Models Over the past decade, many commodity distributed
More informationPATH PROBLEMS IN SKEW-SYMMETRIC GRAPHS ANDREW V. GOLDBERG COMPUTER SCIENCE DEPARTMENT STANFORD UNIVERSITY STANFORD, CA
PATH PROBLEMS IN SKEW-SYMMETRIC GRAPHS ANDREW V. GOLDBERG COMPUTER SCIENCE DEPARTMENT STANFORD UNIVERSITY STANFORD, CA 94305 GOLDBERG@CS.STANFORD.EDU AND ALEXANDER V. KARZANOV INSTITUTE FOR SYSTEMS ANALYSIS
More informationCombinatorial Optimization Spring Term 2015 Rico Zenklusen. 2 a = ( 3 2 ) 1 E(a, A) = E(( 3 2 ), ( 4 0
3 2 a = ( 3 2 ) 1 E(a, A) = E(( 3 2 ), ( 4 0 0 1 )) 0 0 1 2 3 4 5 Figure 9: An example of an axis parallel ellipsoid E(a, A) in two dimensions. Notice that the eigenvectors of A correspond to the axes
More informationLecture 13 Spectral Graph Algorithms
COMS 995-3: Advanced Algorithms March 6, 7 Lecture 3 Spectral Graph Algorithms Instructor: Alex Andoni Scribe: Srikar Varadaraj Introduction Today s topics: Finish proof from last lecture Example of random
More informationCombinatorial optimization problems
Combinatorial optimization problems Heuristic Algorithms Giovanni Righini University of Milan Department of Computer Science (Crema) Optimization In general an optimization problem can be formulated as:
More informationAlgorithms: Lecture 12. Chalmers University of Technology
Algorithms: Lecture 1 Chalmers University of Technology Today s Topics Shortest Paths Network Flow Algorithms Shortest Path in a Graph Shortest Path Problem Shortest path network. Directed graph G = (V,
More informationMetric Approximations (Embeddings) M M 1 2 f M 1, M 2 metric spaces. f injective mapping from M 1 to M 2. M 2 dominates M 1 under f if d M1 (u; v) d M
Approximating a nite metric by a small number of tree metrics Moses Charikar Chandra Chekuri Ashish Goel Sudipto Guha Serge Plotkin Metric Approximations (Embeddings) M M 1 2 f M 1, M 2 metric spaces.
More information6.046 Recitation 11 Handout
6.046 Recitation 11 Handout May 2, 2008 1 Max Flow as a Linear Program As a reminder, a linear program is a problem that can be written as that of fulfilling an objective function and a set of constraints
More informationLecture 14 - P v.s. NP 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) February 27, 2018 Lecture 14 - P v.s. NP 1 In this lecture we start Unit 3 on NP-hardness and approximation
More information12. LOCAL SEARCH. gradient descent Metropolis algorithm Hopfield neural networks maximum cut Nash equilibria
12. LOCAL SEARCH gradient descent Metropolis algorithm Hopfield neural networks maximum cut Nash equilibria Lecture slides by Kevin Wayne Copyright 2005 Pearson-Addison Wesley h ttp://www.cs.princeton.edu/~wayne/kleinberg-tardos
More informationLecture 9 Tuesday, 4/20/10. Linear Programming
UMass Lowell Computer Science 91.503 Analysis of Algorithms Prof. Karen Daniels Spring, 2010 Lecture 9 Tuesday, 4/20/10 Linear Programming 1 Overview Motivation & Basics Standard & Slack Forms Formulating
More information1 Review for Lecture 2 MaxFlow
Comp 260: Advanced Algorithms Tufts University, Spring 2009 Prof. Lenore Cowen Scribe: Wanyu Wang Lecture 13: Back to MaxFlow/Edmonds-Karp 1 Review for Lecture 2 MaxFlow A flow network showing flow and
More informationPrimal vector is primal infeasible till end. So when primal feasibility attained, the pair becomes opt. & method terminates. 3. Two main steps carried
4.1 Primal-Dual Algorithms Katta G. Murty, IOE 612 Lecture slides 4 Here we discuss special min cost ow problems on bipartite networks, the assignment and transportation problems. Algorithms based on an
More informationA Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks Maxim A. Babenko Ignat I. Kolesnichenko Ilya P. Razenshteyn Moscow State University 36th International Conference on Current
More informationLecture notes on the ellipsoid algorithm
Massachusetts Institute of Technology Handout 1 18.433: Combinatorial Optimization May 14th, 007 Michel X. Goemans Lecture notes on the ellipsoid algorithm The simplex algorithm was the first algorithm
More informationALGORITHMS AND COMPLETE FORMULATIONS FOR THE NETWORK DESIGN PROBLEM Trilochan Sastry Indian Institute of Management, Ahmedabad November 1997 Abstract
ALGORITHMS AND COMPLETE FORMULATIONS FOR THE NETWORK DESIGN PROBLEM Trilochan Sastry Indian Institute of Management, Ahmedabad November 1997 Abstract We study the multi commodity uncapacitated network
More information4/12/2011. Chapter 8. NP and Computational Intractability. Directed Hamiltonian Cycle. Traveling Salesman Problem. Directed Hamiltonian Cycle
Directed Hamiltonian Cycle Chapter 8 NP and Computational Intractability Claim. G has a Hamiltonian cycle iff G' does. Pf. Suppose G has a directed Hamiltonian cycle Γ. Then G' has an undirected Hamiltonian
More informationColumn Generation for Extended Formulations
1 / 28 Column Generation for Extended Formulations Ruslan Sadykov 1 François Vanderbeck 2,1 1 INRIA Bordeaux Sud-Ouest, France 2 University Bordeaux I, France ISMP 2012 Berlin, August 23 2 / 28 Contents
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 informationFeasibility Pump Heuristics for Column Generation Approaches
1 / 29 Feasibility Pump Heuristics for Column Generation Approaches Ruslan Sadykov 2 Pierre Pesneau 1,2 Francois Vanderbeck 1,2 1 University Bordeaux I 2 INRIA Bordeaux Sud-Ouest SEA 2012 Bordeaux, France,
More informationFRACTIONAL PACKING OF T-JOINS. 1. Introduction
FRACTIONAL PACKING OF T-JOINS FRANCISCO BARAHONA Abstract Given a graph with nonnegative capacities on its edges, it is well known that the capacity of a minimum T -cut is equal to the value of a maximum
More informationMaximum Skew-Symmetric Flows. September Abstract
Maximum Skew-Symmetric Flows Andrew V. Goldberg NEC Research Institute 4 Independence Way Princeton, NJ 08540 avg@research.nj.nec.com Alexander V. Karzanov Institute for Systems Analysis 9, Prospect 60
More informationInput: System of inequalities or equalities over the reals R. Output: Value for variables that minimizes cost function
Linear programming Input: System of inequalities or equalities over the reals R A linear cost function Output: Value for variables that minimizes cost function Example: Minimize 6x+4y Subject to 3x + 2y
More informationConvex Optimization. Ofer Meshi. Lecture 6: Lower Bounds Constrained Optimization
Convex Optimization Ofer Meshi Lecture 6: Lower Bounds Constrained Optimization Lower Bounds Some upper bounds: #iter μ 2 M #iter 2 M #iter L L μ 2 Oracle/ops GD κ log 1/ε M x # ε L # x # L # ε # με f
More informationThe maximum flow problem
The maximum flow problem A. Agnetis 1 Basic properties Given a network G = (N, A) (having N = n nodes and A = m arcs), and two nodes s (source) and t (sink), the maximum flow problem consists in finding
More informationWeek 4. (1) 0 f ij u ij.
Week 4 1 Network Flow Chapter 7 of the book is about optimisation problems on networks. Section 7.1 gives a quick introduction to the definitions of graph theory. In fact I hope these are already known
More informationApproximating minimum cost connectivity problems
Approximating minimum cost connectivity problems Guy Kortsarz Zeev Nutov Rutgers University, Camden The Open University of Israel guyk@camden.rutgers.edu nutov@openu.ac.il 1 Introduction We survey approximation
More informationMaximizing Capacity with Power Control under Physical Interference Model in Simplex Mode
Maximizing Capacity with Power Control under Physical Interference Model in Simplex Mode Peng-Jun Wan, Chao Ma, Shaojie Tang, and Boliu Xu Illinois Institute of Technology, Chicago, IL 60616 Abstract.
More informationNon-TDI graph-optimization with supermodular functions (extended abstract)
Egerváry Research Group on Combinatorial Optimization Technical reports TR-2015-14. Published by the Egerváry Research Group, Pázmány P. sétány 1/C, H1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.
More informationAlgorithm Design and Analysis
Algorithm Design and Analysis LETURE 28 Network Flow hoosing good augmenting paths apacity scaling algorithm A. Smith /4/2008 A. Smith; based on slides by K. Wayne and S. Raskhodnikova Pre-break: Ford-Fulkerson
More informationIncreasing the Span of Stars
Increasing the Span of Stars Ning Chen Roee Engelberg C. Thach Nguyen Prasad Raghavendra Atri Rudra Gynanit Singh Department of Computer Science and Engineering, University of Washington, Seattle, WA.
More informationLocal Flow Partitioning for Faster Edge Connectivity
Local Flow Partitioning for Faster Edge Connectivity Monika Henzinger, Satish Rao, Di Wang University of Vienna, UC Berkeley, UC Berkeley Edge Connectivity Edge-connectivity λ: least number of edges whose
More informationRouting. Topics: 6.976/ESD.937 1
Routing Topics: Definition Architecture for routing data plane algorithm Current routing algorithm control plane algorithm Optimal routing algorithm known algorithms and implementation issues new solution
More informationThe Maximum Flow Problem with Disjunctive Constraints
The Maximum Flow Problem with Disjunctive Constraints Ulrich Pferschy Joachim Schauer Abstract We study the maximum flow problem subject to binary disjunctive constraints in a directed graph: A negative
More informationIntegrated Network Design and Scheduling Problems with Parallel Identical Machines: Complexity Results and Dispatching Rules
Integrated Network Design and Scheduling Problems with Parallel Identical Machines: Complexity Results and Dispatching Rules Sarah G. Nurre 1 and Thomas C. Sharkey 1 1 Department of Industrial and Systems
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 information10. Ellipsoid method
10. Ellipsoid method EE236C (Spring 2008-09) ellipsoid method convergence proof inequality constraints 10 1 Ellipsoid method history developed by Shor, Nemirovski, Yudin in 1970s used in 1979 by Khachian
More informationRobust Optimal Discrete Arc Sizing for Tree-Shaped Potential Networks
Robust Optimal Discrete Arc Sizing for Tree-Shaped Potential Networks Martin Robinius, Lars Schewe, Martin Schmidt, Detlef Stolten, Johannes Thürauf, Lara Welder Abstract. We consider the problem of discrete
More informationMAS210 Graph Theory Exercises 5 Solutions (1) v 5 (1)
MAS210 Graph Theor Exercises 5 Solutions Q1 Consider the following directed network N. x 3 (3) v 1 2 (2) v 2 5 (2) 2(2) 1 (0) 3 (0) 2 (0) 3 (0) 3 2 (2) 2(0) v v 5 1 v 6 The numbers in brackets define an
More informationScheduling with AND/OR Precedence Constraints
Scheduling with AND/OR Precedence Constraints Seminar Mathematische Optimierung - SS 2007 23th April 2007 Synthesis synthesis: transfer from the behavioral domain (e. g. system specifications, algorithms)
More information5 Flows and cuts in digraphs
5 Flows and cuts in digraphs Recall that a digraph or network is a pair G = (V, E) where V is a set and E is a multiset of ordered pairs of elements of V, which we refer to as arcs. Note that two vertices
More informationBranch-and-Bound. Leo Liberti. LIX, École Polytechnique, France. INF , Lecture p. 1
Branch-and-Bound Leo Liberti LIX, École Polytechnique, France INF431 2011, Lecture p. 1 Reminders INF431 2011, Lecture p. 2 Problems Decision problem: a question admitting a YES/NO answer Example HAMILTONIAN
More informationTheoretical Computer Science
Theoretical Computer Science 411 (010) 417 44 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: wwwelseviercom/locate/tcs Resource allocation with time intervals
More information2 Push and Pull Source Sink Push
1 Plaing Push vs Pull: Models and Algorithms for Disseminating Dnamic Data in Networks. R.C. Chakinala, A. Kumarasubramanian, Kofi A. Laing R. Manokaran, C. Pandu Rangan, R. Rajaraman Push and Pull 2 Source
More informationACO Comprehensive Exam March 20 and 21, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms Part a: You are given a graph G = (V,E) with edge weights w(e) > 0 for e E. You are also given a minimum cost spanning tree (MST) T. For one particular edge
More informationBin packing and scheduling
Sanders/van Stee: Approximations- und Online-Algorithmen 1 Bin packing and scheduling Overview Bin packing: problem definition Simple 2-approximation (Next Fit) Better than 3/2 is not possible Asymptotic
More informationOn Column-restricted and Priority Covering Integer Programs
On Column-restricted and Priority Covering Integer Programs Deeparnab Chakrabarty Elyot Grant Jochen Könemann November 24, 2009 Abstract In a 0,1-covering integer program (CIP), the goal is to pick a minimum
More informationMulticriteria approximation through decomposition
Multicriteria approximation through decomposition Carl Burch Sven Krumke y Madhav Marathe z Cynthia Phillips x Eric Sundberg { Abstract We propose a general technique called solution decomposition to devise
More informationBranching Rules for Minimum Congestion Multi- Commodity Flow Problems
Clemson University TigerPrints All Theses Theses 8-2012 Branching Rules for Minimum Congestion Multi- Commodity Flow Problems Cameron Megaw Clemson University, cmegaw@clemson.edu Follow this and additional
More informationAggregate Supply. Econ 208. April 3, Lecture 16. Econ 208 (Lecture 16) Aggregate Supply April 3, / 12
Aggregate Supply Econ 208 Lecture 16 April 3, 2007 Econ 208 (Lecture 16) Aggregate Supply April 3, 2007 1 / 12 Introduction rices might be xed for a brief period, but we need to look beyond this The di
More informationLecture 9: Dantzig-Wolfe Decomposition
Lecture 9: Dantzig-Wolfe Decomposition (3 units) Outline Dantzig-Wolfe decomposition Column generation algorithm Relation to Lagrangian dual Branch-and-price method Generated assignment problem and multi-commodity
More information