Primal-dual algorithms for connected facility location problems

DOI10.1007/3-540-45753-4_22MaRDI QIDQ4411292zbMATH OpenFDO

Authors Chaitanya Swamy, Amit Kumar

Publication date 7 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2462/24620256.htm

Mathematics Subject Classification ID

Approximation algorithms (68W25) Discrete location and assignment (90B80) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Primal-dual algorithms for connected facility location problems
• Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
• A 6.55 factor primal-dual approximation algorithm for the connected facility location problem
• Approximation algorithms for connected facility location problems
• A primal-dual approximation algorithm for the facility location problem with submodular penalties
• Dual-based local search for the connected facility location and related problems
• Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
• scientific article; zbMATH DE number 3885614
• Improved Approximation Algorithm for Connected Facility Location Problems
• Approximate the lower-bounded connected facility location problem

Cited in

(13)

• Approximation algorithms for connected facility location problems
• A 6.55 factor primal-dual approximation algorithm for the connected facility location problem
• A branch and cut algorithm for hub location problems with single assignment
• Primal-dual algorithms for connected facility location problems
• Connected facility location via random facility sampling and core detouring
• Dual-based local search for the connected facility location and related problems
• Improved Approximation Algorithm for Connected Facility Location Problems
• Securely connected facility location in metric graphs
• Construction Line Algorithms for the Connection Location-Allocation Problem
• Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
• Contention-aware data caching in wireless multi-hop ad hoc networks
• Cross-monotonic cost sharing methods for connected facility location games
• On the parameterized complexity of reconfiguration of connected dominating sets

This page was built for publication: Primal-dual algorithms for connected facility location problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411292)