Constant approximation algorithms for rectangle stabbing and related problems
From MaRDI portal
Publication:866919
DOI10.1007/s00224-005-1273-8zbMath1107.68123OpenAlexW2010855239MaRDI QIDQ866919
Publication date: 14 February 2007
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-005-1273-8
Related Items (5)
Fixed-parameter tractability and lower bounds for stabbing problems ⋮ Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization ⋮ Geometric stabbing via threshold rounding and factor revealing LPs ⋮ The parameterized complexity of stabbing rectangles ⋮ Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
This page was built for publication: Constant approximation algorithms for rectangle stabbing and related problems
