multicommodity rent or buy: approximation via cost sharing martin pál joint work with anupam gupta...
Post on 21-Dec-2015
214 views
TRANSCRIPT
![Page 1: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/1.jpg)
Multicommodity Rent or Buy:Approximation Via Cost Sharing
Martin Pál
Joint work withAnupam Gupta Amit Kumar
Tim Roughgarden
![Page 2: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/2.jpg)
•Cost sharing algorithm for Steiner forest: what do we want
•Cost sharing for Steiner forest +Simple randomized analysis = Approximation for Rent or Buy
•How does the cost sharing work
Talk Outline
![Page 3: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/3.jpg)
Steiner Forest and Rent or Buy
Input:
•Weighted graph G
•Set of demand pairs D
Solution:
A set of paths, one for each (si,ti) pair
![Page 4: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/4.jpg)
Steiner Forest and Rent or Buy
Input:
•Weighted graph G
•Set of demand pairs D
Steiner Forest: pay ce for each edge e we use, regardless of how many paths use it
![Page 5: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/5.jpg)
Steiner Forest and Rent or Buy
Input:
•Weighted graph G
•Set of demand pairs D
Rent or Buy: pay ce per pair for renting, or buy for Mce
![Page 6: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/6.jpg)
Related Work
•2-approximation for Steiner Forest[Agarwal, Klein, Ravi 91] , [Goemans, Williamson 95]
•Constant approximation for Rent or Buy[Kumar, Gupta, Roughgarden 02]
•Spanning Tree + Randomization = Single Sink Rent or Buy[Gupta, Kumar, Roughgarden 03]
![Page 7: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/7.jpg)
Cost Sharing for Steiner Forest
Cost sharing algorithm: approximation algorithm that given D, computes solution FD and set of cost shares (D,j) for jD
![Page 8: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/8.jpg)
Cost Sharing for Steiner Forest
Cost sharing algorithm: approximation algorithm that given D, computes solution FD and set of cost shares (D,j) for jD
(P1) Constant approximation: cost(FD) St*(D)
(P2) Cost shares do not overpay: j (D,j) St*(D)
(P3) Cost shares pay enough: let D’ = D {si, ti}
dist(si, ti) in G/ FD (D’,i)
![Page 9: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/9.jpg)
What does (P3) say
![Page 10: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/10.jpg)
What does (P3) say
Solution for Solution for
a
c
( , ) (a+c)
b
![Page 11: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/11.jpg)
The Rent or Buy Algorithm
Algorithm SimpleMRoB:
1. Mark each demand pair independently at random with prob. 1/M. Let S be the marked set.
2. Use a cost sharing algorithm to build a Steiner forest on the marked set S.
3. Rent shortest paths between all unmarked pairs.
![Page 12: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/12.jpg)
Analysis
Claim: Expected cost of buying an optimal Steiner forest on S is at most OPT.
Corollary: Expected cost of step 2 OPT
Corollary: Expected sum of cost shares OPT
![Page 13: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/13.jpg)
Analysis (2)
Claim: Expected cost of step 3 is at most OPT.
Let S’ = S – {i}
E[cost share of i | S’] = 1/M M (S’+i, i)
E[rental cost of i | S’] = (M-1)/M (dist(sj, tj) in G/FS’ )
From (P3):
E[rental cost of i | S’] E[cost share of i | S’]
E[rental cost of i] E[cost share of i]
![Page 14: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/14.jpg)
Analysis (3)
There is a cost sharing algorithm with = 6, = 6.
Theorem: SimpleMRoB is a 12-approximation algorithm.
![Page 15: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/15.jpg)
Existing Steiner forest algorithms
•Each demand starts in a separate cluster
•Active clusters grow at unit rate
•When two clusters touch, they merge into one
•Demands may get deactivated
•A cluster is deactivated if it has no active demands
•Inactive clusters do not grow
•Keep adding enough edges so that all active demands in a component are connected
![Page 16: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/16.jpg)
Existing Steiner forest algorithms
![Page 17: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/17.jpg)
Existing Steiner forest algorithms
![Page 18: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/18.jpg)
Existing Steiner forest algorithms
![Page 19: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/19.jpg)
Existing Steiner forest algorithms
![Page 20: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/20.jpg)
Existing Steiner forest algorithms
![Page 21: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/21.jpg)
Existing Steiner forest algorithms
![Page 22: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/22.jpg)
How to define cost shares
Need to pay for the growth of the clusters
Active demands share equally the cost of growth of a cluster.
a(u,) = 1 / (# of active demands in cluster with u)
= 0 if u not active at time
cost share of u = a(u,) d
![Page 23: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/23.jpg)
Does it work?
(P1) Constant approximation: cost(FD) St*(D)
(P2) Cost shares do not overpay: j (D,j) St*(D)
(P3) Cost shares pay enough: let D’ = D {si, ti}
dist(si, ti) in G/ FD (D’,i)
(P1) and (P2) easy to verify. How about (P3)?
![Page 24: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/24.jpg)
Does it work?
2 22+
![Page 25: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/25.jpg)
Does it work?
2 22+
![Page 26: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/26.jpg)
Does it work?
2 22+
cost share of = 2/n +
![Page 27: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/27.jpg)
Does it work?
2 22+
cost share of = 2/n + << 2 +
solution without
![Page 28: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/28.jpg)
Solution
Inflate the balls !
1. Run the standard [AKR, GW] algorithm
2. Note the time Tj when each demand j deactivated
3. Run the algorithm again, except that now every demand j deactivated at time Tj for some > 1
Adopting proof from [GW]: buying cost at most 2OPT.
![Page 29: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/29.jpg)
Works on our example
= 2
![Page 30: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/30.jpg)
Works on our example
![Page 31: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/31.jpg)
Works on our example
![Page 32: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/32.jpg)
Works on our example
![Page 33: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/33.jpg)
How to prove (P3)
Need to compare runs on D and D’ = D {si, ti}
Idea: 1. pick a {si, ti} path P in G/ FD
2. Show that (D’,i) accounts for a constant fraction of length(P)
![Page 34: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/34.jpg)
How to prove (P3)
Need to compare runs on D and D’ = D {si, ti}
Idea: 1. pick a {si, ti} path P in G/ FD
2. Show that (D’,i) accounts for a constant fraction of length(P)
Instead of (D’,i), use alone(i), the total time si or ti was alone in its cluster
![Page 35: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/35.jpg)
How to prove (P3)
Need to compare runs on D and D’ = D {si, ti}
Idea: 1. pick a {si, ti} path P in G/ FD
2. Show that (D’,i) accounts for a constant fraction of length(P)
![Page 36: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/36.jpg)
How to prove (P3)
Need to compare runs on D and D’ = D {si, ti}
Idea: 1. pick a {si, ti} path P in G/ FD
2. Show that (D’,i) accounts for a constant fraction of length(P)
![Page 37: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/37.jpg)
How to prove (P3)
Need to compare runs on D and D’ = D {si, ti}
Idea: 1. pick a {si, ti} path P in G/ FD
2. Show that (D’,i) accounts for a constant fraction of length(P)
(D’, ), = 2.5
alone( ) = 2.0
![Page 38: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/38.jpg)
Mapping of layers
Lonely layer: generated by si or ti while the only active demand in its cluster
Each non-lonely layer in the D’ run maps to layers in the scaled D run.
Idea:
length(P) = #of lonely and non-lonely layers crossed in D’ run
length(P) #of layers it crosses in scaled D run
Hence: for each non-lonely layer, -1 lonely layers crossed.
![Page 39: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/39.jpg)
Mapping not one to one
Two non-lonely layers in D’ run can map to the same layer in scaled D run.
D’ run
scaled D run
![Page 40: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/40.jpg)
Not all layers of D run cross P
A layer in D’ run that crosses P can map to a layer in scaled D run that does not cross P
D’ run scaled D runsi si
The “waste” can be bounded.
![Page 41: Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden](https://reader030.vdocuments.us/reader030/viewer/2022032521/56649d585503460f94a37a54/html5/thumbnails/41.jpg)
Open problems
• Does SimpleMRoB work with unscaled GW? With an arbitrary Steiner forest subroutine?
• Other cost sharing functions? (crossmonotonic..)