scientific article; zbMATH DE number 1947062

zbMATH Open1013.90121MaRDI QIDQ4411292FDOQ4411292

Authors: Chaitanya Swamy, Amit Kumar 

Publication date: 7 July 2003

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

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

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

Cited In (13)

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

This page was built for publication:

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