The Online Metric Matching Problem for Doubling Metrics
Authors:
- 1 January 2012
- book chapter
- Published by Springer Nature
- p. 424-435
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- An O(log2 k)-Competitive Algorithm for Metric Bipartite MatchingLecture Notes in Computer Science, 2007
- Randomized online algorithms for minimum metric bipartite matching2006
- 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
- On-line network optimization problems1998
- On the k -server conjectureJournal of the ACM, 1995
- On-line algorithms for weighted bipartite matching and stable marriagesTheoretical Computer Science, 1994
- Online Weighted MatchingJournal of Algorithms, 1993