@inproceedings{783e1245f1194caaacb8c490d945e35a,
title = "Approximate minimum-weight matching with outliers under translation",
abstract = "Our goal is to compare two planar point sets by finding subsets of a given size such that a minimum-weight matching between them has the smallest weight. This can be done by a translation of one set that minimizes the weight of the matching. We give efficient algorithms (a) for finding approximately optimal matchings, when the cost of a matching is the Lp-norm of the tuple of the Euclidean distances between the pairs of matched points, for any p ∈ [1,∞], and (b) for constructing small-size approximate minimization (or matching) diagrams: partitions of the translation space into regions, together with an approximate optimal matching for each region.",
keywords = "Approximation, Minimum-weight partial matching, Pattern matching",
author = "Agarwal, {Pankaj K.} and Haim Kaplan and Geva Kipper and Wolfgang Mulzer and G{\"u}nter Rote and Micha Sharir and Allen Xiao",
note = "Publisher Copyright: {\textcopyright} Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, G{\"u}nter Rote, Micha Sharir, and Allen Xiao;; 29th International Symposium on Algorithms and Computation, ISAAC 2018 ; Conference date: 16-12-2018 Through 19-12-2018",
year = "2018",
month = dec,
day = "1",
doi = "10.4230/LIPIcs.ISAAC.2018.26",
language = "אנגלית",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
pages = "26:1--26:13",
editor = "Chung-Shou Liao and Der-Tsai Lee and Wen-Lian Hsu",
booktitle = "29th International Symposium on Algorithms and Computation, ISAAC 2018",
}