Demand Hitting and Covering of Intervals
From MaRDI portal
Publication:2971657
DOI10.1007/978-3-319-53007-9_24zbMath1490.90251OpenAlexW2583976822MaRDI QIDQ2971657
Minati De, Sathish Govindarajan, Aniket Basu Roy, Datta Krupa R.
Publication date: 7 April 2017
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53007-9_24
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
Complexity and approximation for discriminating and identifying code problems in geometric setups ⋮ Discriminating Codes in Geometric Setups
Cites Work
- Algorithmic graph theory and perfect graphs
- On the \(k\)-coloring of intervals
- Weighted Geometric Set Multi-cover via Quasi-uniform Sampling
- On the set multicover problem in geometric settings
- On Column-Restricted and Priority Covering Integer Programs
- Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
- The Geometry of Scheduling
This page was built for publication: Demand Hitting and Covering of Intervals