Inexpensive d‐dimensional matchings

DOI10.1002/RSA.10027MaRDI QIDQ4534217zbMATH OpenOpenAlexFDO

Authors Bae-Shi Huang, Ljubomir Perković, Eric Schmutz

Publication date 5 June 2002

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.10027

zbMATH Keywords

\(d\)-partite graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On the weighted Euclidean matching problem in R^d
• Random matching problems on the complete graph
• A lower bound for approximating the geometric minimum weight matching
• Approximate minimum weight matching on points in k-dimensional space
• Experimental and Efficient Algorithms

Cited in

(2)

• Worst-case greedy matchings in the unitd-cube
• The minimum perfect matching in pseudo-dimension \(0<q<1\)

This page was built for publication: Inexpensive d‐dimensional matchings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4534217)