On Capacitated Set Cover Problems
From MaRDI portal
Publication:3088080
DOI10.1007/978-3-642-22935-0_4zbMath1343.90074OpenAlexW1902458841MaRDI QIDQ3088080
Nikhil Bansal, Ravishankar Krishnaswamy, Barna Saha
Publication date: 17 August 2011
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22935-0_4
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (5)
Fixed-parameter algorithms for unsplittable flow cover ⋮ Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time ⋮ Unnamed Item ⋮ On capacitated covering with unit balls ⋮ Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time
Cites Work
- Unnamed Item
- Unnamed Item
- Approximating covering integer programs with multiplicity constraints
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Almost optimal set covers in finite VC-dimension
- Weighted geometric set cover via quasi-uniform sampling
- Bin Packing via Discrepancy of Permutations
- A threshold of ln n for approximating set cover
- On Column-Restricted and Priority Covering Integer Programs
- A unified approach to approximating resource allocation and scheduling
This page was built for publication: On Capacitated Set Cover Problems