Pages that link to "Item:Q866919"

The following pages link to Constant approximation algorithms for rectangle stabbing and related problems (Q866919):

Displaying 12 items.

• Fixed-parameter tractability and lower bounds for stabbing problems (Q359746) (← links)
• Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization (Q393084) (← links)
• Partial multicovering and the \(d\)-consecutive ones property (Q408373) (← links)
• Algorithms for high dimensional stabbing problems (Q916570) (← links)
• Stabbing isothetic boxes and rectangles in \(O(n\log n)\) time (Q1208431) (← links)
• The parameterized complexity of stabbing rectangles (Q2428672) (← links)
• Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem (Q3150279) (← links)
• Parameterized Complexity of Stabbing Rectangles and Squares in the Plane (Q3605506) (← links)
• (Q4862345) (← links)
• Algorithms – ESA 2004 (Q5464600) (← links)
• Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems (Q5757391) (← links)
• Geometric stabbing via threshold rounding and factor revealing LPs (Q6124825) (← links)