Journal of Combinatorial Optimization

, Volume 27, Issue 1, pp 100–114 | Cite as

Online bottleneck matching

Article

Abstract

We consider the online bottleneck matching problem, where \(k\) server-vertices lie in a metric space and \(k\) request-vertices that arrive over time each must immediately be permanently assigned to a server-vertex. The goal is to minimize the maximum distance between any request and its server. Because no algorithm can have a competitive ratio better than \(O(k)\) for this problem, we use resource augmentation analysis to examine the performance of three algorithms: the naive Greedy algorithm, Permutation, and Balance. We show that while the competitive ratio of Greedy improves from exponential (when each server-vertex has one server) to linear (when each server-vertex has two servers), the competitive ratio of Permutation remains linear when an extra server is introduced at each server-vertex. The competitive ratio of Balance is also linear with an extra server at each server-vertex, even though it has been shown that an extra server makes it constant-competitive for the min-weight matching problem.

Keywords

Online algorithms Bottleneck matching Resource augmentation Approximation algorithms Matching 

References

  1. Chung C, Pruhs K, Uthaisombut P (2008) The online transportation problem: on the exponential boost of one extra server. In: LATIN 2008, pp 228–239Google Scholar
  2. Hartline JD, Roughgarden T (2009) Simple versus optimal mechanisms. In: ACM conference on electronic commerce, pp 225–234Google Scholar
  3. Idury R, Schaffer A (1992) A better lower bound for on-line bottleneck matching, manuscriptGoogle Scholar
  4. Kalyanasundaram B, Pruhs K (1993) Online weighted matching. J Algorithms 14(3):478–488. Preliminary version appeared in SODA, pp 231–240, 1991Google Scholar
  5. Kalyanasundaram B, Pruhs K (2000a) Speed is as powerful as clairvoyance. J ACM 47:617–643. doi:10.1145/347476.347479. http://dl.acm.org/10.1145/347476.347479. ISSN 0004–5411. Preliminary version appeared in FOCS, 214–221, 1995Google Scholar
  6. Kalyanasundaram B, Pruhs K (2000b) The online transportation problem. SIAM J Discrete Math 13(3): 370–383. Preliminary version appeared in ESA, pp 484–493, 1995Google Scholar
  7. Khuller S, Mitchell SG, Vazirani VV (1994) On-line algorithms for weighted bipartite matching and stable marriages. Theor Comput Sci 127:255–267. doi:10.1016/0304-3975(94)90042-6. http://dl.acm.org/citation.cfm?id=179131.179134. ISSN 0304–3975Google Scholar
  8. Phillips CA, Stein C, Torng E, Wein J (2002) Optimal time-critical scheduling via resource augmentation. Algorithmica 32(2):163–200. Preliminary version appeared in STOC, pp 140–149, 1997Google Scholar
  9. Roughgarden T, Tardos É (2002) How bad is selfish routing? J ACM 49(2):236–259. Preliminary version appeared in FOCS, pp 93–102, 2000Google Scholar

Copyright information

© Springer Science+Business Media New York 2012

Authors and Affiliations

  1. 1.Mathematics and Computer Science DepartmentSouthwestern UniversityGeorgetownUSA
  2. 2.Department of Computer ScienceConnecticut CollegeNew LondonUSA

Personalised recommendations