Covering things with things
DOI10.1007/S00454-004-1108-4zbMATH Open1079.68102OpenAlexW1968541942MaRDI QIDQ2484005FDOQ2484005
Authors: Stefan Langerman, Pat Morin 
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
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of packing and covering (05B40)
Cited In (32)
- Slightly Superexponential Parameterized Problems
- Unique Covering Problems with Geometric Sets
- Borsuk's covering for blunt bodies
- The parameterized complexity of stabbing rectangles
- A parameterized algorithm for the hyperplane-cover problem
- Title not available (Why is that?)
- Digital straightness, circularity, and their applications to image analysis
- Geometric hitting set for segments of few orientations
- A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem
- On Covering Segments with Unit Intervals
- Covers of some varietal products
- Covering the plane with sprays
- Cutting polygons into small pieces with chords: Laser-based localization
- The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
- Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem
- FPT-algorithms for minimum-bends tours
- A hierarchical approach for sparse source blind signal separation problem
- On Covering Points with Minimum Turns
- Approximability of covering cells with line segments
- Parameterized complexity of geometric covering problems having conflicts
- On the approximability of covering points by lines and related problems
- On fair covering and hitting problems
- The computational complexity and approximability of a series of geometric covering problems
- Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover}
- Fixed-parameter tractability and lower bounds for stabbing problems
- Exact multi-covering problems with geometric sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finding Points in General Position
- Set covering with our eyes closed
- Geometric covering number: covering points with curves
This page was built for publication: Covering things with things
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484005)
