Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
Work
Year: 2008
Type: article
Abstract: In the rectangle stabbing problem, we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines that intersect all ... more
Source: ACM Transactions on Algorithms
Institutions Tel Aviv University, Massachusetts Institute of Technology, University of Haifa, IBM Research - Thomas J. Watson Research Center
Cites: 21
Cited by: 46
Related to: 10
FWCI: 4.944
Citation percentile (by year/subfield): 96.57
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze