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

Combinatorial aspects of packing and covering (05B40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

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

(38)

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

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)