A parameterized algorithm for the hyperplane-cover problem

DOI10.1016/j.tcs.2010.08.012zbMath1234.68447OpenAlexW2017987453MaRDI QIDQ410731

Wenjun Li, Jianxin Wang, Jian'er Chen

Publication date: 3 April 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.08.012

zbMATH Keywords

computational geometryparameterized algorithmhyperplane-coverline-cover

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

On the approximability of covering points by lines and related problems ⋮ Improved parameterized algorithms for minimum link-length rectilinear spanning path problem ⋮ On Covering Points with Minimum Turns ⋮ On Covering Segments with Unit Intervals

Cites Work

• Unnamed Item
• Unnamed Item
• Finding little hyperplanes in bigger ones
• On the complexity of locating linear facilities in the plane
• Covering things with things
• Covering a Set of Points with a Minimum Number of Lines

This page was built for publication: A parameterized algorithm for the hyperplane-cover problem