Capacitated Arc Stabbing

DOI10.1016/J.JDA.2012.09.001zbMATH Open1267.90164OpenAlexW2086463357MaRDI QIDQ2376793FDOQ2376793

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

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

zbMATH Keywords

lot sizingpartial coveringcapacitated coveringarc stabbinginterval stabbingprize collecting covering

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

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

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)