CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
A linear time randomized approximation algorithm for Euclidean matching
Authors
CE Bell
D Avis
+30Â more
DL Miller
E Afgan
EA Riskin
EL Lawler
EM Reingold
G Das
H Gabow
H Gabow
H Kuhn
HJ Choi
HN Gabow
J Edmonds
J Edmonds
J Edmonds
JB Lim
KJ Supowit
L Zhu
M Iri
Mahdi Imanparast
MO Ball
O Marcotte
PM Vaidya
PM Vaidya
S Khuller
Seyed Naser Hashemi
SG Akl
TH Cormen
U Derigs
V Kolmogorov
W Cook
Publication date
Publisher
'Springer Science and Business Media LLC'
Doi
Cite
Abstract
Abstract is not available.
Similar works
Full text
Available Versions
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
Last time updated on 31/10/2020