Approximation algorithms for aligning points
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2185597 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 1049272 (Why is no real title available?)
- scientific article; zbMATH DE number 1182933 (Why is no real title available?)
- scientific article; zbMATH DE number 1433426 (Why is no real title available?)
- A matroid approach to finding edge connectivity and packing arborescences
- Approximation algorithms for NP-complete problems on planar graphs
- Approximation schemes for covering and packing problems in image processing and VLSI
- Computing closely matching upper and lower bounds on textile nesting problems
- LABELING POINTS WITH CIRCLES
- Multiple translational containment. I: An approximate algorithm
- Planar Formulae and Their Uses
- Schematization of road networks
- Simple planar graph partition into three forests
- Some optimal inapproximability results
Cited in
(8)- scientific article; zbMATH DE number 3965443 (Why is no real title available?)
- scientific article; zbMATH DE number 1629847 (Why is no real title available?)
- Approximation algorithms for aligning points
- Rotating Multiple Sets of Labeled Points to Bring Them Into Close Coincidence: A Generalized Wahba Problem
- Approximation algorithms for orthogonal line centers
- Algorithms of placing recovery points
- Generalized approximate algorithms for point set congruence
- scientific article; zbMATH DE number 1996311 (Why is no real title available?)
This page was built for publication: Approximation algorithms for aligning points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1879366)