Partial-matching RMS distance under translation: combinatorics and algorithms
DOI10.1007/S00453-017-0326-0zbMATH Open1392.68424OpenAlexW2624507311MaRDI QIDQ724243FDOQ724243
Authors: Rinat Ben-Avraham, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis, Matthias Henze 
Publication date: 25 July 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://real.mtak.hu/71242/1/1411.7273v1.pdf
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
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Fibonacci heaps and their uses in improved network optimization algorithms
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Applications of random sampling in computational geometry. II
- Long monotone paths in line arrangements
- On cores and indivisibility
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- Monotone Paths in Planar Convex Subdivisions and Polytopes
- Title not available (Why is that?)
- Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms
- Counting houses of Pareto optimal matchings in the house allocation problem
Cited In (4)
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)
