Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
From MaRDI portal
Publication:5900928
DOI10.1007/b11961zbMath1279.68358MaRDI QIDQ5900928
Yinyu Ye, Mohammad Mahdian, Jia-Wei Zhang
Publication date: 26 May 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11961
Related Items
On Min-Max r-Gatherings, Combinatorial approximation algorithms for the robust facility location problem with penalties, New approximation algorithms for the unsplittable capacitated facility location problem, A 3-approximation algorithm for the facility location problem with uniform capacities, A splitter location-allocation problem in designing fiber optic access networks, On min-max \(r\)-gatherings, Approximation algorithms for the robust/soft-capacitated 2-level facility location problems, Approximation algorithms for facility location problems with a special class of subadditive cost functions, Online unit clustering: Variations on a theme, Improved approximation algorithms for capacitated facility location problems, \(\mathrm{M}^p\)UFLP: universal facility location problem in the \(p\)-th power of metric space, Approximating soft-capacitated facility location problem with uncertainty, A PTAS for the cardinality constrained covering with unit balls, The approximation gap for the metric facility location problem is not yet closed, Approximating the two-level facility location problem via a quasi-greedy approach, An approximation algorithm for a facility location problem with stochastic demands and inventories, Approximation algorithms for hard capacitated \(k\)-facility location problems, LP-Based Algorithms for Capacitated Facility Location
