Oblivious buy-at-bulk in planar graphs

Srivathsan Srinivasagopalan, Costas Busch, S. Sitharama Iyengar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations


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.

Original languageEnglish (US)
Title of host publicationWALCOM
Subtitle of host publicationAlgorithms and Computation - 5th International Workshop, WALCOM 2011, Proceedings
Number of pages12
StatePublished - 2011
Externally publishedYes
Event5th Annual Workshop on Algorithms and Computation, WALCOM 2011 - New Delhi, India
Duration: Feb 18 2011Feb 20 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6552 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference5th Annual Workshop on Algorithms and Computation, WALCOM 2011
CityNew Delhi

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Oblivious buy-at-bulk in planar graphs'. Together they form a unique fingerprint.

Cite this