Pages that link to "Item:Q3150279"

The following pages link to Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem (Q3150279):

Displaying 34 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)
• Load-balancing spatially located computations using rectangular partitions (Q455987) (← links)
• Evader interdiction: algorithms, complexity and collateral damage (Q490228) (← links)
• Improved approximations for guarding 1.5-dimensional terrains (Q534789) (← links)
• Approximation algorithms for \(k\)-hurdle problems (Q627530) (← links)
• A unified approach to approximating partial covering problems (Q633845) (← links)
• Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
• Approximation algorithms for orthogonal line centers (Q831691) (← links)
• Partial multicuts in trees (Q861281) (← links)
• Constant approximation algorithms for rectangle stabbing and related problems (Q866919) (← links)
• Rounding to an integral program (Q943791) (← links)
• On the parameterized complexity of multiple-interval graph problems (Q1001898) (← links)
• On dominating set of some subclasses of string graphs (Q2144448) (← links)
• A PTAS for the horizontal rectangle stabbing problem (Q2164717) (← links)
• On the shortest separating cycle (Q2306364) (← links)
• The parameterized complexity of stabbing rectangles (Q2428672) (← links)
• SEPARATING POINTS BY AXIS-PARALLEL LINES (Q3373055) (← links)
• APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES (Q3397507) (← links)
• On the Approximability of Orthogonal Order Preserving Layout Adjustment (Q3449805) (← links)
• Identifying Codes in Hereditary Classes of Graphs and VC-Dimension (Q3449863) (← links)
• The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants (Q3507345) (← links)
• Parameterized Complexity of Stabbing Rectangles and Squares in the Plane (Q3605506) (← links)
• Latency Constrained Aggregation in Chain Networks Admits a PTAS (Q3638456) (← links)
• (Q5091054) (← links)
• Algorithms – ESA 2004 (Q5464600) (← links)
• Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems (Q5757391) (← links)
• Covering segments with unit squares (Q5894547) (← links)
• Covering and packing of rectilinear subdivision (Q5918965) (← links)
• Geometric stabbing via threshold rounding and factor revealing LPs (Q6124825) (← links)
• Approximation algorithms for orthogonal line centers (Q6166042) (← links)
• Generalized class cover problem with axis-parallel strips (Q6543343) (← links)
• A PTAS for the horizontal rectangle stabbing problem (Q6589763) (← links)