Partial-matching RMS distance under translation: combinatorics and algorithms
From MaRDI portal
Publication:724243
Recommendations
- Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms
- Bottleneck partial-matching Voronoi diagrams and applications
- Hausdorff distance under translation for points and balls
- Hausdorff distance under translation for points and balls
- Bottleneck partial-matching Voronoi diagrams and applications
Cites work
- scientific article; zbMATH DE number 1433426 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- Applications of random sampling in computational geometry. II
- Counting houses of Pareto optimal matchings in the house allocation problem
- Fibonacci heaps and their uses in improved network optimization algorithms
- Long monotone paths in line arrangements
- Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms
- Monotone paths in planar convex subdivisions and polytopes
- On cores and indivisibility
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Cited in
(6)- Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms
- Bottleneck partial-matching Voronoi diagrams and applications
- scientific article; zbMATH DE number 820058 (Why is no real title available?)
- Bottleneck partial-matching Voronoi diagrams and applications
- scientific article; zbMATH DE number 7561380 (Why is no real title available?)
- Linear transformation distance for bichromatic matchings
This page was built for publication: Partial-matching RMS distance under translation: combinatorics and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724243)