Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 170

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Geometry Helps in Matching

Vaidya, Pravin M. · 1989 · SIAM Journal on Computing

Abstract

A set of $2n$ points on the plane induces a complete weighted undirected graph as follows. The points are the vertices of the graph, and the weight of an edge between any two points is the distance between the points under some metric. The problem of finding a minimum weight complete matching (MWCM) in such a graph is studied. An $O(n^{2.5} (\log n)^4 )$ algorithm is given for finding an MWCM in such a graph, for the $L_1 $ (manhattan ), the $L_2 $ (Euclidean), and the $L_\infty $ metrics. The bipartite version of the problem is also studied, where half the points are painted with one color and the other half with another color, and the restriction is that a point of one color may be matched only to a point of another color. An $O(n^{2.5} \log n)$ algorithm for the bipartite version, for the $L_1 $, $L_2$, and $L_\infty $ metrics, is presented. The running time for the bipartite version can be further improved to $O(n^2 (\log n)^3 )$ for the $L_1 $ and $L_\infty $ metrics.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/0218080

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Cited by

See all 170

Metadata

Authors
Vaidya, P. M.
Venue
SIAM Journal on Computing
Published
1989-12
Volume
18
Issue
6
Pages
1201-1225
ISSN
  • 0097-5397 (ISSN-L)
  • 1095-7111
OpenAlex
W2007052372
Cited by
170
References
1
FWCI
4.84
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Geometry Helps in Matching. https://app.cochat.ai/papers/10.1137/0218080
The paper
Vaidya, P. M. (1989). Geometry Helps in Matching. SIAM Journal on Computing. https://doi.org/10.1137/0218080

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.