Theory and Application of Width Bounded Geometric Separator

DOI10.1007/11672142_22MaRDI QIDQ5449806zbMATH OpenOpenAlexFDO

Authors Bin Fu

Publication date 19 March 2008

Published in STACS 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11672142_22

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Theory and application of width bounded geometric separators
• Sublinear time width-bounded separators and their application to the protein side-chain packing problem
• Computing and Combinatorics
• A PTAS for a disc covering problem using width-bounded separators
• Geometric separation and exact solutions for the parameterized independent set problem on disk graphs

Cited in

(6)

• The most points connected-covering problem with two disks
• The searching over separators strategy to solve some NP-hard problems in subexponential time
• A PTAS for the cardinality constrained covering with unit balls
• Theory and application of width bounded geometric separators
• An improved approximation algorithm for the most points covering problem
• Sublinear time width-bounded separators and their application to the protein side-chain packing problem

This page was built for publication: Theory and Application of Width Bounded Geometric Separator

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