Improved algorithms for fault tolerant facility location

MaRDI QIDQ2768358zbMATH OpenFDO

Authors Sudipto Guha, Adam Meyerson, Kamesh Munagala

Publication date 30 January 2002

zbMATH Keywords

facility location problemgreedy local-search type techniques

Mathematics Subject Classification ID

Search theory (90B40) Discrete location and assignment (90B80) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A constant factor approximation algorithm for the fault-tolerant facility location problem
• Fault-tolerant facility location
• scientific article; zbMATH DE number 2079405
• Robust fault tolerant uncapacitated facility location
• LP-rounding algorithms for the fault-tolerant facility placement problem (extended abstract)

Cited in

(22)

• An approximation algorithm for the fault tolerant metric facility location problem
• Robust fault tolerant uncapacitated facility location
• Anycasting in connection-oriented computer networks: Models, algorithms and results
• An approximation algorithm for reliable facility location problem
• Robust fault tolerant uncapacitated facility location
• A distributed approximation algorithm for fault-tolerant metric facility location
• Improved approximation algorithm for fault-tolerant facility placement
• Locating Servers for Reliability and Affine Embeddings
• Fault-tolerant facility location: a randomized dependent LP-rounding algorithm
• Linear time algorithms for approximating the facility terminal cover problem
• Improved approximation algorithms for the robust fault-tolerant facility location problem
• A constant factor approximation algorithm for the fault-tolerant facility location problem
• scientific article; zbMATH DE number 2079405 (Why is no real title available?)
• LP-rounding algorithms for the fault-tolerant facility placement problem
• LP-rounding algorithms for the fault-tolerant facility placement problem (extended abstract)
• A constant factor approximation algorithm for fault-tolerant k-median
• Fault-tolerant facility location
• Disjoint-path facility location: theory and practice
• Mixed fault tolerance in server assignment: combining reinforcement and backup
• Mixed fault tolerance in server assignment: combining reinforcement and backup
• Buy-at-bulk facility location on trees
• A polynomial-time exact algorithm for the connected k-facility location problem on trees

This page was built for publication: Improved algorithms for fault tolerant facility location

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