Approximation algorithms for aligning points

DOI10.1007/s00453-003-1033-6zbMath1087.68692OpenAlexW1975266040MaRDI QIDQ1879366

Sergio Cabello, Marc J. van Kreveld

Publication date: 22 September 2004

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/24339

zbMATH Keywords

geometric optimization

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing closely matching upper and lower bounds on textile nesting problems
• Multiple translational containment. I: An approximate algorithm
• Simple planar graph partition into three forests
• A matroid approach to finding edge connectivity and packing arborescences
• Approximation schemes for covering and packing problems in image processing and VLSI
• Planar Formulae and Their Uses
• Approximation algorithms for NP-complete problems on planar graphs
• LABELING POINTS WITH CIRCLES
• Schematization of road networks
• Some optimal inapproximability results

This page was built for publication: Approximation algorithms for aligning points