A Monte Carlo solution to the minimal Euclidean matching
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F09%3A00502095" target="_blank" >RIV/49777513:23520/09:00502095 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
A Monte Carlo solution to the minimal Euclidean matching
Original language description
We present an approximate algorithm for the minimal Euclidean matching problem. It is intended as an alternative to the Edmonds optimal algorithm which we find too intricate. Our approach builds on the Kuhn-Munkres algorithm for matching in a bipartite graph and uses a Monte Carlo method to adapt the algorithm for general graphs.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/LC06008" target="_blank" >LC06008: Center of Computer Graphics</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Algoritmy 2009 : 18th conference on scientific computing
ISBN
978-80-227-3032-7
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
—
Publisher name
Slovak University of Technology
Place of publication
Bratislava
Event location
Podbanské
Event date
Mar 20, 2009
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000267157200042