Extending the Accommodating Function

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review


The applicability of the accommodating function, a relatively new measure for the quality of on-line algorithms, is extended. If a limited amount n of some resource is available, the accommodating function A (α) is the competitive ratio when input sequences are restricted to those for which the amount α n of resources suffices for an optimal off-line algorithm. The accommodating function was originally used only for α ≥ 1. We focus on α < 1, observe that the function now appears interesting for a greater variety of problems, and use it to make new distinctions between known algorithms and to find new ones.
Original languageEnglish
Title of host publicationComputing and Combinatorics, 8th Annual International Conference, COCOON 2002
Publication date2002
Publication statusPublished - 2002
EventEighth Annual International Computing and Combinatorics Conference - , Singapore
Duration: 15. Aug 200217. Aug 2002


ConferenceEighth Annual International Computing and Combinatorics Conference
SeriesLecture Notes in Computer Science


Dive into the research topics of 'Extending the Accommodating Function'. Together they form a unique fingerprint.

Cite this