Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
From MaRDI portal
Publication:5479367
DOI10.1007/11538462zbMATH Open1142.90438OpenAlexW2649657569MaRDI QIDQ5479367FDOQ5479367
Authors: Jens Maßberg, Jens Vygen 
Publication date: 7 July 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11538462
Recommendations
- Approximation algorithms for a facility location problem with service capacities
- Approximation algorithms for soft-capacitated facility location in capacitated network design
- Approximation algorithms for a capacitated network design problem
- scientific article; zbMATH DE number 1670539
- Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
Cited In (14)
- Approximating airports and railways
- An efficient approximation algorithm for the extension facility location problem on torus internetwork topology
- Approximation algorithms for a facility location problem with service capacities
- A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering
- Algorithms and extended formulations for one and two facility network design
- Title not available (Why is that?)
- Approximation algorithms for soft-capacitated facility location in capacitated network design
- Title not available (Why is that?)
- Perturbation resilience for the facility location problem
- A fast \((2 + 2/7)\)-approximation algorithm for capacitated cycle covering
- On min-max \(r\)-gatherings
- Title not available (Why is that?)
- Capacitated service and regional constraints in location-allocation modeling
- On Min-Max r-Gatherings
This page was built for publication: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5479367)
