article

A competitive 2-server algorithm

Authors:

Sandy Irani,

Ronitt RubinfeldAuthors Info & Claims

Information Processing Letters, Volume 39, Issue 2

Pages 85 - 91

https://doi.org/10.1016/0020-0190(91)90160-J

Published: 31 July 1991 Publication History

Abstract

No abstract available.

Cited By

View all

Sui Y(2023)Two online algorithms for the ambulance systemsJournal of Computer Science and Technology10.1007/BF0295042216:2(176-181)Online publication date: 22-Mar-2023
https://dl.acm.org/doi/10.1007/BF02950422
Coester CKoutsoupias ELazos P(2021)The Infinite Server ProblemACM Transactions on Algorithms10.1145/345663217:3(1-23)Online publication date: 15-Jul-2021
https://dl.acm.org/doi/10.1145/3456632
Cohen IEden AFiat AJeż ŁIndyk P(2015)Pricing online decisionsProceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms10.5555/2722129.2722136(73-91)Online publication date: 4-Jan-2015
https://dl.acm.org/doi/10.5555/2722129.2722136
Show More Cited By

Index Terms

A competitive 2-server algorithm
1. Computing methodologies
  1. Symbolic and algebraic manipulation
    1. Symbolic and algebraic algorithms

Recommendations

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 ...
On the additive constant of the k-server Work Function Algorithm

We consider the Work Function Algorithm for the k-server problem (Chrobak and Larmore, 1991; Koutsoupias and Papadimitriou, 1995) [2,4]. We show that if the Work Function Algorithm is c-competitive, then it is also strictly(2c)-competitive. As a ...
The competitive ratio for on-line dual bin packing with restricted input sequences

We consider the On-Line Dual Bin Packing problem where we have a fixed number n of bins of equal size and a sequence of items. The goal is to maximize the number of items that are packed in the bins by an on-line algorithm. An investigation of First-Fit ...

Comments

Information & Contributors

Information

Published In

Information Processing Letters Volume 39, Issue 2

July 31, 1991

52 pages

ISSN:0020-0190

Editor:
W. M. Turski
Warsaw Univ., Banacha, Poland

Issue’s Table of Contents

Publisher

Elsevier North-Holland, Inc.

United States

Publication History

Published: 31 July 1991

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 20 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Sui Y(2023)Two online algorithms for the ambulance systemsJournal of Computer Science and Technology10.1007/BF0295042216:2(176-181)Online publication date: 22-Mar-2023
https://dl.acm.org/doi/10.1007/BF02950422
Coester CKoutsoupias ELazos P(2021)The Infinite Server ProblemACM Transactions on Algorithms10.1145/345663217:3(1-23)Online publication date: 15-Jul-2021
https://dl.acm.org/doi/10.1145/3456632
Cohen IEden AFiat AJeż ŁIndyk P(2015)Pricing online decisionsProceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms10.5555/2722129.2722136(73-91)Online publication date: 4-Jan-2015
https://dl.acm.org/doi/10.5555/2722129.2722136
Koutsoupias E(2009)The k-server problemComputer Science Review10.1016/j.cosrev.2009.04.0023:2(105-118)Online publication date: 1-May-2009
https://dl.acm.org/doi/10.1016/j.cosrev.2009.04.002
Chrobak M(2004)SIGACT news online algorithms column 2ACM SIGACT News10.1145/970831.97084135:1(38-48)Online publication date: 1-Mar-2004
https://dl.acm.org/doi/10.1145/970831.970841
Bartal YRosén A(1997)The Distributedk-Server Problem-A Competitive Distributed Translator fork-Server AlgorithmsJournal of Algorithms10.1006/jagm.1996.082623:2(241-264)Online publication date: 1-May-1997
https://dl.acm.org/doi/10.1006/jagm.1996.0826
Koutsoupias EPapadimitriou C(1995)On the k-server conjectureJournal of the ACM10.1145/210118.21012842:5(971-983)Online publication date: 1-Sep-1995
https://dl.acm.org/doi/10.1145/210118.210128
Fiat ARabani YRavid Y(1994)Competitive k-server algorithmsJournal of Computer and System Sciences10.1016/S0022-0000(05)80060-148:3(410-428)Online publication date: 1-Jun-1994
https://dl.acm.org/doi/10.1016/S0022-0000%2805%2980060-1
Fiat ARabani YRavid YSchieber B(1994)A deterministicO(k3)-competitivek-server algorithm for the circleAlgorithmica10.1007/BF0118999411:6(572-578)Online publication date: 1-Jun-1994
https://dl.acm.org/doi/10.1007/BF01189994
Karlin AManasse MMcgeoch LOwicki S(1994)Competitive randomized algorithms for nonuniform problemsAlgorithmica10.1007/BF0118999311:6(542-571)Online publication date: 1-Jun-1994
https://dl.acm.org/doi/10.1007/BF01189993

Abstract

Cited By

Index Terms

Recommendations

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

On the additive constant of the k-server Work Function Algorithm

The competitive ratio for on-line dual bin packing with restricted input sequences

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations