Article

Free access

Competitive algorithms for on-line problems

Authors:

Mark Manasse,

Lyle McGeoch,

Daniel SleatorAuthors Info & Claims

STOC '88: Proceedings of the twentieth annual ACM symposium on Theory of computing

Pages 322 - 333

https://doi.org/10.1145/62212.62243

Published: 01 January 1988 Publication History

PDF eReader

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.

References

[1]

Borodin, A., Linial, N., and Saks, M. An optimal online algorithm for metrical task systems. In Proceedings of the 19th A CM Symposium on Theot~y of Computing, pages 373-382, New York, 1987.

Digital Library

Google Scholar

[2]

Bentley, J. L. and McOcoch, C. C. Amortized analyses of serf-organizing sequential search heuristics. Communications of the ACM, 28(4):- 404--411, April 1985.

Digital Library

Google Scholar

[3]

Calderbank, A. R., Coffman, Jr., E. G., and Flatto, L. Sequencing problems in two-server systems. Mathematics of Operations Research, 10(4):585-598, November 1985.

Crossref

Google Scholar

[4]

Calderbank, A. R., Coffman, Jr., E. G., and Flatto, L. Sequencing two servers on a sphere. Commun. Statist.-Stochastic Models, 1 (1): 17- 28, November 1985.

Crossref

Google Scholar

[5]

Karlin, A. R., Manasse, M. S., Rudolph, L., and $1eator, D. D. Competitive Snoopy Caching. Computer Science Technical Report CMU-CS- 86-164, Carnegie Mellon University, 1986, (To appear in Algorithmica.

Google Scholar

[6]

McGeoch, L. A., Algorithms for Two Graph Problems. Phi) Thesis, Department of Computer Science, Carnegie Mellon University, 1987.

Digital Library

Google Scholar

[7]

Sleator, D. D. and Tarjan, R. E. Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2):202-208, February 1985.

Digital Library

Google Scholar

Cited By

View all

Langberg MSabag O(2024)Competitive Channel-CapacityIEEE Transactions on Information Theory10.1109/TIT.2024.339414970:7(4585-4598)Online publication date: Jul-2024
https://doi.org/10.1109/TIT.2024.3394149
Si Salem TNeglia GIoannidis S(2023)No-regret Caching via Online Mirror DescentACM Transactions on Modeling and Performance Evaluation of Computing Systems10.1145/36052098:4(1-32)Online publication date: 11-Aug-2023
https://dl.acm.org/doi/10.1145/3605209
Bubeck SCoester CRabani YSaha BServedio R(2023)The Randomized 𝑘-Server Conjecture Is False!Proceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585132(581-594)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585132
Show More Cited By

Index Terms

Competitive algorithms for on-line problems
1. Theory of computation
  1. Design and analysis of algorithms

Recommendations

On-line k-Truck Problem and Its Competitive Algorithms

In this paper, based on the Position Maintaining Strategy (PMS for short), on-line scheduling of k -truck problem, which is a generalization of the famous k -server problem, is originally presented by our team. We proposed several competitive ...
Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints
STOC '14: Proceedings of the forty-sixth annual ACM symposium on Theory of computing

We introduce and study a general scheduling problem that we term the Packing Scheduling problem (PSP). In this problem, jobs can have different arrival times and sizes; a scheduler can process job j at rate x_j, subject to arbitrary packing constraints ...
On-line algorithms for 2-space bounded 2-dimensional bin packing

In 2-space bounded model of on-line bin packing, there are 2 active bins, and each item can be packed only into one of the active bins. If it is impossible to pack an item into any active bin, we close one of the current active bins and open a new ...

Comments

Information & Contributors

Information

Published In

STOC '88: Proceedings of the twentieth annual ACM symposium on Theory of computing

January 1988

553 pages

ISBN:0897912640

DOI:10.1145/62212

Chairman:
J'anos Simon
Univ. of Chicago, Illinois

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1988

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC88

Sponsor:

SIGACT

STOC88: 1988 Symposium on the Theory of Computing

May 2 - 4, 1988

Illinois, Chicago, USA

Acceptance Rates

STOC '88 Paper Acceptance Rate 53 of 192 submissions, 28%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

203
Total Citations
View Citations
1,897
Total Downloads

Downloads (Last 12 months)402
Downloads (Last 6 weeks)17

Reflects downloads up to 18 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Langberg MSabag O(2024)Competitive Channel-CapacityIEEE Transactions on Information Theory10.1109/TIT.2024.339414970:7(4585-4598)Online publication date: Jul-2024
https://doi.org/10.1109/TIT.2024.3394149
Si Salem TNeglia GIoannidis S(2023)No-regret Caching via Online Mirror DescentACM Transactions on Modeling and Performance Evaluation of Computing Systems10.1145/36052098:4(1-32)Online publication date: 11-Aug-2023
https://dl.acm.org/doi/10.1145/3605209
Bubeck SCoester CRabani YSaha BServedio R(2023)The Randomized 𝑘-Server Conjecture Is False!Proceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585132(581-594)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585132
Ghodselahi AKuhn F(2023)Toward Online Mobile Facility Location on General MetricsTheory of Computing Systems10.1007/s00224-023-10145-967:6(1268-1306)Online publication date: 1-Dec-2023
https://dl.acm.org/doi/10.1007/s00224-023-10145-9
Castenow JFeldkord BKnollmann TMalatyali MMeyer auf der Heide FAgrawal KLee I(2022)The k-Server with Preferences ProblemProceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3490148.3538595(345-356)Online publication date: 11-Jul-2022
https://dl.acm.org/doi/10.1145/3490148.3538595
Räcke HSchmid SZabrodin RAgrawal KLee I(2022)Approximate Dynamic Balanced Graph PartitioningProceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3490148.3538563(401-409)Online publication date: 11-Jul-2022
https://dl.acm.org/doi/10.1145/3490148.3538563
Zhang WZhang YCheng YZheng S(2022)An online trading problem with an increasing number of available productsJournal of Combinatorial Optimization10.1007/s10878-021-00841-y44:1(518-531)Online publication date: 25-Jan-2022
https://doi.org/10.1007/s10878-021-00841-y
Filotheou ATzitzis ATsardoulias EDimitriou ASymeonidis ASergiadis GPetrou L(2022)Passive Global Localisation of Mobile Robot via 2D Fourier-Mellin Invariant MatchingJournal of Intelligent & Robotic Systems10.1007/s10846-021-01535-7104:2Online publication date: 22-Jan-2022
https://doi.org/10.1007/s10846-021-01535-7
Danassis PSakota MFilos-Ratsikas AFaltings B(2022)Putting ridesharing to the test: efficient and scalable solutions and the power of dynamic vehicle relocationArtificial Intelligence Review10.1007/s10462-022-10145-055:7(5781-5844)Online publication date: 15-Feb-2022
https://doi.org/10.1007/s10462-022-10145-0
Buchbinder NCoester CNaor J(2022)Online k-taxi via Double Coverage and time-reverse primal-dualMathematical Programming10.1007/s10107-022-01815-6197:2(499-527)Online publication date: 13-May-2022
https://doi.org/10.1007/s10107-022-01815-6
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

On-line k-Truck Problem and Its Competitive Algorithms

Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints

On-line algorithms for 2-space bounded 2-dimensional bin packing

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

On-line k-Truck Problem and Its Competitive Algorithms

Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints

On-line algorithms for 2-space bounded 2-dimensional bin packing

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations