A Constant Factor Approximation for the Single Sink Edge Installation Problem
From MaRDI portal
Publication:3654382
DOI10.1137/050643635zbMath1192.68900OpenAlexW1989669912MaRDI QIDQ3654382
Adam Meyerson, Sudipto Guha, Kamesh Munagala
Publication date: 6 January 2010
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://repository.upenn.edu/cgi/viewcontent.cgi?article=1442&context=cis_papers
Related Items (9)
Combinatorial approximation algorithms for buy-at-bulk connected facility location problems ⋮ Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems ⋮ Online Buy-at-Bulk Network Design ⋮ Exact Approaches for Designing Multifacility Buy-at-Bulk Networks ⋮ LP-based approximation algorithms for facility location in buy-at-bulk network design ⋮ Approximation Algorithms for Single and Multi-Commodity Connected Facility Location ⋮ Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph ⋮ Two-level hub Steiner trees ⋮ An improved approximation algorithm for the uniform cost-distance Steiner tree problem
This page was built for publication: A Constant Factor Approximation for the Single Sink Edge Installation Problem
