Covering things with things
From MaRDI portal
Publication:2484005
DOI10.1007/s00454-004-1108-4zbMath1079.68102OpenAlexW1968541942MaRDI QIDQ2484005
Publication date: 2 August 2005
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-004-1108-4
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial aspects of packing and covering (05B40)
Related Items (25)
A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem ⋮ A hierarchical approach for sparse source blind signal separation problem ⋮ Unique Covering Problems with Geometric Sets ⋮ Fixed-parameter tractability and lower bounds for stabbing problems ⋮ Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover} ⋮ On fair covering and hitting problems ⋮ A parameterized algorithm for the hyperplane-cover problem ⋮ The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants ⋮ The parameterized complexity of stabbing rectangles ⋮ On the approximability of covering points by lines and related problems ⋮ Finding Points in General Position ⋮ The computational complexity and approximability of a series of geometric covering problems ⋮ FPT-ALGORITHMS FOR MINIMUM-BENDS TOURS ⋮ Cutting polygons into small pieces with chords: Laser-based localization ⋮ Geometric hitting set for segments of few orientations ⋮ Digital Straightness, Circularity, and Their Applications to Image Analysis ⋮ Slightly Superexponential Parameterized Problems ⋮ Parameterized Complexity of Stabbing Rectangles and Squares in the Plane ⋮ On Covering Points with Minimum Turns ⋮ Unnamed Item ⋮ Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem ⋮ Parameterized complexity of geometric covering problems having conflicts ⋮ Approximability of covering cells with line segments ⋮ Exact multi-covering problems with geometric sets ⋮ On Covering Segments with Unit Intervals
This page was built for publication: Covering things with things
