Randomized online algorithms for minimum metric bipartite matching

Authors:
Adam Meyerson;Akash Nanavati;Laura Poplawski
Affiliations:
University of California, Los Angeles;Google Inc, Mountain View CA;University of California, Los Angeles
Venue:
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Year:
2006

Citing 9
Cited 7

An optimal algorithm for on-line bipartite matching

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Online weighted matching

Journal of Algorithms
On-line algorithms for weighted bipartite matching and stable marriages

Theoretical Computer Science
On the k-server conjecture

Journal of the ACM (JACM)
On approximating arbitrary metrices by tree metrics

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The Online Transportation Problem

SIAM Journal on Discrete Mathematics
A tight bound on approximating arbitrary metrics by tree metrics

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Probabilistic approximation of metric spaces and its algorithmic applications

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Online matching on a line

Theoretical Computer Science

SIGACT news online algorithms column 13: 2007 - an offine perspective

ACM SIGACT News
A randomized algorithm for the on-line weighted bipartite matching problem

Journal of Scheduling
Distributed resource management and matching in sensor networks

IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
An O(log2k)-competitive algorithm for metric bipartite matching

ESA'07 Proceedings of the 15th annual European conference on Algorithms
The online transportation problem: on the exponential boost of one extra server

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Optimal self assembly of modular manipulators with active and passive modules

Autonomous Robots
The online metric matching problem for doubling metrics

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the first poly-logarithmic competitive online algorithm for minimum metric bipartite matching. Via induction and a careful use of potential functions, we show that a simple randomized greedy algorithm is competitive on a hierarchically separated tree. Application of recent results on randomized embedding of metrics into trees yield the poly-logarithmic result for general metrics.