Covering things with things

DOI10.1007/S00454-004-1108-4MaRDI QIDQ2484005zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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)

Recommendations

• scientific article; zbMATH DE number 1947430
• A parameterized algorithm for the hyperplane-cover problem
• Approximating low-dimensional coverage problems
• Computing coverage kernels under restricted settings
• Computing coverage kernels under restricted settings

Cited in

(35)

• Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
• scientific article; zbMATH DE number 1947430 (Why is no real title available?)
• Restricted parameter range promise set cover problems are easy
• scientific article; zbMATH DE number 874507 (Why is no real title available?)
• Slightly superexponential parameterized problems
• A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem
• On Covering Points with Minimum Turns
• Kernelization of the subset general position problem in geometry
• Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem
• Cutting polygons into small pieces with chords: Laser-based localization
• Geometric covering number: covering points with curves
• Set covering with our eyes closed
• Covering the plane with sprays
• A parameterized algorithm for the hyperplane-cover problem
• The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
• On Covering Segments with Unit Intervals
• Borsuk's covering for blunt bodies
• Fixed-parameter tractability and lower bounds for stabbing problems
• FPT-algorithms for minimum-bends tours
• On Geometric Set Cover for Orthants
• Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover}
• Digital straightness, circularity, and their applications to image analysis
• Finding points in general position
• Exact multi-covering problems with geometric sets
• Approximating low-dimensional coverage problems
• The computational complexity and approximability of a series of geometric covering problems
• On fair covering and hitting problems
• A hierarchical approach for sparse source blind signal separation problem
• Unique covering problems with geometric sets
• Covers of some varietal products
• On the approximability of covering points by lines and related problems
• Parameterized complexity of geometric covering problems having conflicts
• The parameterized complexity of stabbing rectangles
• Computing coverage kernels under restricted settings
• Computing coverage kernels under restricted settings

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)