scientific article; zbMATH DE number 1947430

MaRDI QIDQ4411399zbMATH OpenFDO

Authors Stefan Langerman, Pat Morin

Publication date 8 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2461/24610662.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Covering things with things
• scientific article; zbMATH DE number 874507
• scientific article; zbMATH DE number 682080
• Covering a surface
• scientific article; zbMATH DE number 3282420
• scientific article; zbMATH DE number 3282421
• scientific article; zbMATH DE number 3342063
• scientific article; zbMATH DE number 1182895
• scientific article; zbMATH DE number 124521
• Magic coverings

Cited in

(13)

• Borsuk's covering for blunt bodies
• Covering things with things
• Computing coverage kernels under restricted settings
• Computing coverage kernels under restricted settings
• A parameterized algorithm for the hyperplane-cover problem
• Covering the plane with sprays
• Restricted parameter range promise set cover problems are easy
• Approximating low-dimensional coverage problems
• Parameterized complexity of geometric covering problems having conflicts
• On Geometric Set Cover for Orthants
• scientific article; zbMATH DE number 874507 (Why is no real title available?)
• Set covering with our eyes closed
• scientific article; zbMATH DE number 3903967 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411399)