scientific article; zbMATH DE number 2079405
From MaRDI portal
Publication:4471365
zbMATH Open1092.68737MaRDI QIDQ4471365FDOQ4471365
Authors: Chaitanya Swamy, David B. Shmoys 
Publication date: 28 July 2004
Title of this publication is not available (Why is that?)
Recommendations
Searching and sorting (68P10) Approximation algorithms (68W25) Discrete location and assignment (90B80)
Cited In (19)
- 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
- A constant factor approximation algorithm for the fault-tolerant facility location problem
- LP-based approximation algorithms for capacitated facility location
- 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
- Mixed fault tolerance in server assignment: combining reinforcement and backup
- 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
- 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
- The fault-tolerant facility allocation problem
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)
