Distributed near-optimal matching

DOI10.1007/BF01271265zbMath0880.68054OpenAlexW2024165970MaRDI QIDQ1375630

Xiaotie Deng

Publication date: 7 January 1998

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01271265

zbMATH Keywords

randomized algorithmincomplete informationdistributed computingnear-optimal matching

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distributed algorithms (68W15)

Related Items (1)

A lower bound for communication on the crossbar

Cites Work

• On the k-server conjecture
• Competitive algorithms for server problems

This page was built for publication: Distributed near-optimal matching