Optimal Random Matchings on Trees and Applications

DOI10.1007/978-3-540-85363-3_21zbMath1159.68632OpenAlexW1536613172MaRDI QIDQ3541800

Ali Shokoufandeh, Béla Csaba, Jeff Abrahamson

Publication date: 27 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85363-3_21

zbMATH Keywords

random matchinghierarchically separated treessupremum bounds

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Related Items (2)

Optimal random matchings, tours, and spanning trees in hierarchically separated trees ⋮ Bayesian incentive compatibility via matchings

This page was built for publication: Optimal Random Matchings on Trees and Applications