scientific article; zbMATH DE number 2079405

MaRDI QIDQ4471365zbMATH OpenFDO

Authors Chaitanya Swamy, David B. Shmoys

Publication date 28 July 2004

Mathematics Subject Classification ID

Searching and sorting (68P10) Approximation algorithms (68W25) Discrete location and assignment (90B80)

Recommendations

• Fault-tolerant facility location
• Improved algorithms for fault tolerant facility location
• A constant factor approximation algorithm for the fault-tolerant facility location problem
• Robust fault tolerant uncapacitated facility location
• Robust fault tolerant uncapacitated facility location

Cited in

(19)

• The fault-tolerant facility allocation problem
• Fault-tolerant concave facility location problem with uniform requirements
• Improved approximation algorithms for the robust fault-tolerant facility location problem
• Improved algorithms for fault tolerant facility location
• LP-based approximation algorithms for capacitated facility location
• A constant factor approximation algorithm for the fault-tolerant facility location problem
• Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location
• A constant factor approximation algorithm for fault-tolerant \(k\)-median
• Locating Servers for Reliability and Affine Embeddings
• Finding a collective set of items: from proportional multirepresentation to group recommendation
• Mixed fault tolerance in server assignment: combining reinforcement and backup
• Maximum gradient embeddings and monotone clustering
• Mixed fault tolerance in server assignment: combining reinforcement and backup
• Fault-tolerant facility location
• Robust fault tolerant uncapacitated facility location
• Fault-tolerant covering problems in metric spaces
• Graph clustering
• Optimal data placement on networks with a constant number of clients
• Robust fault tolerant uncapacitated facility location

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 Q4471365)