Cost-Distance: Two Metric Network Design
From MaRDI portal
Publication:3395048
DOI10.1137/050629665zbMath1192.68912OpenAlexW2108573551MaRDI QIDQ3395048
Kamesh Munagala, Adam Meyerson, Serge A. Plotkin
Publication date: 20 August 2009
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/009fc48db36c0d46677eb5b1a6328d075ac8b6f7
Related Items
LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design, Combinatorial approximation algorithms for buy-at-bulk connected facility location problems, Approximation Algorithms for Buy-at-Bulk Geometric Network Design, A review of hierarchical facility location models, Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems, Online Buy-at-Bulk Network Design, Improved approximation algorithms for directed Steiner forest, LP-based approximation algorithms for facility location in buy-at-bulk network design, Approximation Algorithms for Single and Multi-Commodity Connected Facility Location, A new approximation algorithm for the multilevel facility location problem, Approximating the two-level facility location problem via a quasi-greedy approach, Approximability of unsplittable shortest path routing problems, Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph, Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees, Optimal shrinking of the distribution chain: the facilities delocation decision, Unnamed Item, Improved approximation algorithms for multilevel facility location problems, An improved approximation algorithm for the uniform cost-distance Steiner tree problem
