Distributed near-optimal matching

DOI10.1007/BF01271265zbMath0880.68054MaRDI QIDQ1375630

Xiaotie Deng

Publication date: 7 January 1998

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

randomized algorithm; incomplete information; distributed computing; near-optimal matching

Mathematics Subject Classification ID

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

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

68W15: Distributed algorithms

Related Items

A lower bound for communication on the crossbar

Cites Work

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