Oblivious Buy-at-Bulk in Planar Graphs

DOI10.1007/978-3-642-19094-0_6zbMath1317.68284arXiv1010.0401OpenAlexW2140954236MaRDI QIDQ3078378

Costas Busch, Srivathsan Srinivasagopalan, S. Sitharama Iyengar

Publication date: 20 February 2011

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.0401

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of graph theory (05C90) Deterministic network models in operations research (90B10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

Sparse covers for planar graphs and graphs that exclude a fixed minor

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating the Single-Sink Link-Installation Problem in Network Design
• Universal approximations for TSP, Steiner tree, and set cover
• Oblivious network design
• Network Design via Core Detouring for Problems without a Core
• Dynamic Steiner Tree Problem
• Distributed Computing: A Locality-Sensitive Approach
• An Oblivious O(1)-Approximation for Single Source Buy-at-Bulk
• A constant factor approximation for the single sink edge installation problems
• Improved sparse covers for graphs excluding a fixed minor

This page was built for publication: Oblivious Buy-at-Bulk in Planar Graphs