Capacitated Arc Stabbing

DOI10.1016/J.JDA.2012.09.001MaRDI QIDQ2376793zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

lot sizingpartial coveringcapacitated coveringarc stabbinginterval stabbingprize collecting covering

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
• On interval and circular-arc covering problems
• Approximation Algorithms for Capacitated Rectangle Stabbing
• On a circle-cover minimization problem
• Partial multicovering and the d-consecutive ones property

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 1947055 (Why is no real title available?)
• scientific article; zbMATH DE number 2038708 (Why is no real title available?)
• scientific article; zbMATH DE number 830382 (Why is no real title available?)
• A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
• A primal-dual approximation algorithm for partial vertex cover: Making educated guesses
• Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
• An analysis of the greedy algorithm for the submodular set covering problem
• An optimal parallel algorithm for the minimum circle-cover problem
• Approximation Algorithms for Capacitated Rectangle Stabbing
• Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities
• Approximation algorithms for partial covering problems
• Approximation of Partial Capacitated Vertex Cover
• Capacitated vertex covering
• Covering Problems with Hard Capacities
• Deterministic Production Planning: Algorithms and Complexity
• Improved complexity bounds for location problems on the real line
• Improved performance of the greedy algorithm for partial cover
• Linear time algorithms on circular-arc graphs
• Multi-item lot-sizing with joint set-up costs
• On a circle-cover minimization problem
• Optimizing over Consecutive 1's and Circular 1's Constraints
• Parallel circle-cover algorithms
• Using homogeneous weights for approximating the partial cover problem

Cited in

(2)

• Priority-based bin packing with subset constraints
• Dynamic Ray Stabbing

This page was built for publication: Capacitated Arc Stabbing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376793)