Integer Programming and Combinatorial Optimization
From MaRDI portal
Publication:5712454
DOI10.1007/b97946zbMath1092.90524MaRDI QIDQ5712454
Retsef Levi, Chaitanya Swamy, David B. Shmoys
Publication date: 23 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b97946
90C59: Approximation methods and heuristics in mathematical programming
90B80: Discrete location and assignment
Related Items
Capacitated Domination Problem, Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem, Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks, New approximation algorithms for the unsplittable capacitated facility location problem, A model for minimizing active processor time, Capacitated domination problem, An approximation algorithm for the \(k\)-level capacitated facility location problem, LP-based approximation algorithms for capacitated facility location, Centrality of trees for capacitated \(k\)-center, A 6.55 factor primal-dual approximation algorithm for the connected facility location problem