TY - GEN

T1 - Oblivious buy-at-bulk in planar graphs

AU - Srinivasagopalan, Srivathsan

AU - Busch, Costas

AU - Iyengar, S. Sitharama

N1 - Copyright:
Copyright 2011 Elsevier B.V., All rights reserved.

PY - 2011

Y1 - 2011

N2 - In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of demands can be routed along these paths. The demands could be aggregated at intermediate edges where the fusion-cost is specified by a canonical (non-negative concave) function f. We give a novel algorithm for planar graphs which is oblivious with respect to the demands, and is also oblivious with respect to the fusion function f. The algorithm is deterministic and computes the fixed set of paths in polynomial time, and guarantees a O(logn) approximation ratio for any set of demands and any canonical fusion function f, where n is the number of nodes. The algorithm is asymptotically optimal, since it is known that this problem cannot be approximated with better than Ω(logn) ratio. To our knowledge, this is the first tight analysis for planar graphs, and improves the approximation ratio by a factor of logn with respect to previously known results.

AB - In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of demands can be routed along these paths. The demands could be aggregated at intermediate edges where the fusion-cost is specified by a canonical (non-negative concave) function f. We give a novel algorithm for planar graphs which is oblivious with respect to the demands, and is also oblivious with respect to the fusion function f. The algorithm is deterministic and computes the fixed set of paths in polynomial time, and guarantees a O(logn) approximation ratio for any set of demands and any canonical fusion function f, where n is the number of nodes. The algorithm is asymptotically optimal, since it is known that this problem cannot be approximated with better than Ω(logn) ratio. To our knowledge, this is the first tight analysis for planar graphs, and improves the approximation ratio by a factor of logn with respect to previously known results.

UR - http://www.scopus.com/inward/record.url?scp=79952273061&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79952273061&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-19094-0_6

DO - 10.1007/978-3-642-19094-0_6

M3 - Conference contribution

AN - SCOPUS:79952273061

SN - 9783642190933

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 33

EP - 44

BT - WALCOM

T2 - 5th Annual Workshop on Algorithms and Computation, WALCOM 2011

Y2 - 18 February 2011 through 20 February 2011

ER -