Proceedings Article10.1145/62212.62243
Competitive algorithms for on-line problems
Mark S. Manasse,Lyle A. McGeoch,Daniel D. Sleator +2 more
- 01 Jan 1988
- pp 322-333
449
TL;DR: This paper presents several general results concerning competitive algorithms, as well as results on specific on-line problems.
read more
Abstract: An on-line problem is one in which an algorithm must handle a sequence of requests, satisfying each request without knowledge of the future requests. Examples of on-line problems include scheduling the motion of elevators, finding routes in networks, allocating cache memory, and maintaining dynamic data structures. A competitive algorithm for an on-line problem has the property that its performance on any sequence of requests is within a constant factor of the performance of any other algorithm on the same sequence. This paper presents several general results concerning competitive algorithms, as well as results on specific on-line problems.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Planning Algorithms: Introductory Material
Steven M. LaValle
- 01 Jan 2006
TL;DR: This coherent and comprehensive book unifies material from several sources, including robotics, control theory, artificial intelligence, and algorithms, into planning under differential constraints that arise when automating the motions of virtually any mechanical system.
7.4K
An optimal algorithm for on-line bipartite matching
Richard M. Karp,Umesh Vazirani,Vijay V. Vazirani +2 more
- 01 Apr 1990
TL;DR: This work applies the general approach to data structures, bin packing, graph coloring, and graph coloring to bipartite matching and shows that a simple randomized on-line algorithm achieves the best possible performance.
Probabilistic approximation of metric spaces and its algorithmic applications
Yair Bartal
- 14 Oct 1996
TL;DR: It is proved that any metric space can be probabilistically-approximated by hierarchically well-separated trees (HST) with a polylogarithmic distortion.
875
On approximating arbitrary metrices by tree metrics
Yair Bartal
- 23 May 1998
TL;DR: A generation algorithm for the random generation of models of amorphous strutures, which can be modeled as graphs which see embedded in d-space, using the well known approach of simulating a rapidly-mixing Markov chain.
609
Competitive paging algorithms
TL;DR: The marking algorithm is developed, a randomized on-line algorithm for the paging problem, which it is proved that its expected cost on any sequence of requests is within a factor of 2Hk of optimum.
548
References
Amortized efficiency of list update and paging rules
TL;DR: This article shows that move-to-front is within a constant factor of optimum among a wide class of list maintenance rules, and analyzes the amortized complexity of LRU, showing that its efficiency differs from that of the off-line paging rule by a factor that depends on the size of fast memory.
2.5K
Competitive snoopy caching
TL;DR: This work presents new on-line algorithms to be used by the caches of snoopy cache multiprocessor systems to decide which blocks to retain and which to drop in order to minimize communication over the bus.
733
An optimal online algorithm for metrical task systems
Allan Borodin,Nati Linial,Michael Saks +2 more
- 01 Jan 1987
TL;DR: A general model for the processing of sequences of tasks and a general online decision algorithm are introduced and it is shown that this algorithm is optimal among all online algorithms.
Sequencing Problems in Two-Server Systems
TL;DR: A service system in which two identical servers move one at a time along a linear array of N positions is analyzed, and within a simple probability model server-selection policies are compared in terms of the equilibrium expected distance a server is moved in processing a request.
52
Related Papers (5)
Allan Borodin,Nati Linial,Michael Saks +2 more
- 01 Jan 1987
Allan Borodin,Ran El-Yaniv +1 more
- 01 Jan 1998