An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching
Authors:
- 1 January 2007
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 522-533
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Online matching on a lineTheoretical Computer Science, 2005
- The Online Matching Problem on a LineLecture Notes in Computer Science, 2004
- A tight bound on approximating arbitrary metrics by tree metrics2003
- An optimal deterministic algorithm for online b-matchingTheoretical Computer Science, 2000
- The Online Transportation ProblemSIAM Journal on Discrete Mathematics, 2000
- On-line network optimization problems1998
- A General Approximation Technique for Constrained Forest ProblemsSIAM Journal on Computing, 1995
- On-line algorithms for weighted bipartite matching and stable marriagesTheoretical Computer Science, 1994
- Searching in the PlaneInformation and Computation, 1993
- Online Weighted MatchingJournal of Algorithms, 1993