approximating buy-at-bulk and shallow-light k-steiner trees.pptVIP

Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees Mohammad T. Hajiaghayi (CMU) Guy Kortsarz (Rutgers) Mohammad R. Salavatipour (U. Alberta) Presented by: Zeev Nutov Definition of Buy-at-Bulk k-Steiner Tree Given an undirected graph G(V,E), terminal set T? V, a root s?T, and integer k?|T|. Given two cost functions on the edges: Buy cost Rent cost Goal: find a subtree H spanning at least k terminals including root s minimizing where Motivation Network design problems with two cost functions have many applications, e.g. in bandwidth reservation when we have economies of scale Example: capacity on a link can be purchased at discrete units: with costs: where Motivation (cont’d) So if you buy at bulk you save More generally, we have a concave function where f(b) is the minimum cost of cables with bandwidth b. Equivalent Cost Measure Equivalent model: cost distance There are a set of pairs to be connected For each possible cable connection e we can: Buy it at b(e): and have unlimited bandwidth Rent it at r(e): and pay for each unit of flow A feasible solution: buy and/or rent some edges to connect every si to ti. Goal: minimize the total cost Equivalent Cost Measure (cont’d) If E’ is the set of edges of the solution, the cost is: where is the shortest path in We can think of as the start-up cost and as the per use cost (length). Special Cases If all si’s (sources) are equal we have the single-source case (SS-BB) Known Results for Buy-at-Bulk Problems Formally introduced by Salman et al. [SCRS’97] O(log n) approximation for the uniform case [AA’97, Bartal’98, FRT’03] O(log n) approx for the single-sink case [MMP’00] Hardness of Ω(log log n) for the single-sink case [CGNS’05] and Ω(log1/2-? n) in general [Andrews’04], unless NP? ZPTIME(npolylog(n)) Constant approx for several special cases: [AKR’91,GW’95,KM’00,KGR’02,KGPR’02,GKR’0