Capacitated Arc Stabbing
From MaRDI portal
Publication:2376793
DOI10.1016/j.jda.2012.09.001zbMath1267.90164MaRDI QIDQ2376793
Dror Rawitz, Shimon (Moni) Shahar
Publication date: 24 June 2013
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2012.09.001
lot sizing; partial covering; capacitated covering; arc stabbing; interval stabbing; prize collecting covering
90C35: Programming involving graphs or networks
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved performance of the greedy algorithm for partial cover
- On a circle-cover minimization problem
- Multi-item lot-sizing with joint set-up costs
- Parallel circle-cover algorithms
- An optimal parallel algorithm for the minimum circle-cover problem
- Improved complexity bounds for location problems on the real line
- Linear time algorithms on circular-arc graphs
- An analysis of the greedy algorithm for the submodular set covering problem
- A primal-dual approximation algorithm for partial vertex cover: Making educated guesses
- Using Homogeneous Weights for Approximating the Partial Cover Problem
- Approximation Algorithms for Capacitated Rectangle Stabbing
- Covering Problems with Hard Capacities
- Optimizing over Consecutive 1's and Circular 1's Constraints
- A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
- Deterministic Production Planning: Algorithms and Complexity
- Capacitated vertex covering
- Approximation algorithms for partial covering problems
- Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
- Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities
- Approximation of Partial Capacitated Vertex Cover
