Online matching on a line

Theoretical Computer Science

Volumn 332, Issue 1-3, 2005, Pages 251-264

  Fuchs, Bernhard ^a   Hochstättler, Winfried ^b   Kern, Walter ^c  

^a UNIVERSITY OF COLOGNE   (Germany)

^b BRANDENBURG UNIVERSITY OF TECHNOLOGY   (Germany)

^c UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Competitive analysis; Matching; Online algorithms

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; FUNCTIONS; ONLINE SYSTEMS; PROBLEM SOLVING;

COMPETITIVE ANALYSIS; MATCHING; ONLINE ALGORITHMS; ONLINE SERVERS;

SET THEORY;

EID: 13644262390     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.10.028     Document Type: Article

References (7)

1. R. Baeza-Yates, J. Culberson, and G. Rawlins Searching in the plane Inform. Comput. 106 1993 234 252
2. A. Borodin, and R. El-Yaniv Online Computation and Competitive Analysis 1998 Cambride University Press Cambridge
3. E. Koutsoupias, A. Nanavati, The online matching problem on a line, in: K. Jansen, R. Solis-Oba, (Eds.), Approximation and Online Algorithms, First International Workshop, WAOA 2003, Lecture Notes in Computer Science, Vol. 2909, Springer, Berlin, 2004, pp. 179-191.
4. E. Koutsoupias, and C. Papadimitriou On the k -server conjecture J. ACM 42 5 1995 971 983
5. C. Papadimitriou, and M. Yannakakis Shortest paths without a map Theoret. Comput. Sci. 84 1991 127 150
6. K. Pruhs, B. Kalyanasundaram, Online network optimization problems, in: A. Fiat, G. Woeginger (Eds.), Online Algorithms: The State of the Art, Lecture Notes in Computer science, Vol. 1442, Springer, Berlin, 1998, pp. 268-280.
7. G. Woeginger, Personal communication.