On capacitated set cover problems
DOI10.1007/978-3-642-22935-0_4zbMATH Open1343.90074OpenAlexW1902458841MaRDI QIDQ3088080FDOQ3088080
Authors: N. 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
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Cites Work
- A threshold of ln n for approximating set cover
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Almost optimal set covers in finite VC-dimension
- Weighted geometric set cover via quasi-uniform sampling
- Title not available (Why is that?)
- A unified approach to approximating resource allocation and scheduling
- On column-restricted and priority covering integer programs
- Approximating covering integer programs with multiplicity constraints
- On the approximability of some network design problems
Cited In (8)
- Title not available (Why is that?)
- Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching
- Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
- On capacitated covering with unit balls
- Title not available (Why is that?)
- Constant factor approximation algorithm for weighted flow-time on a single machine in pseudopolynomial time
- Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time
- Fixed-parameter algorithms for unsplittable flow cover
This page was built for publication: On capacitated set cover problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3088080)
