Skip to main content
Log in

On Algorithm Design for Metrical Task Systems

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract.

We extend the definition of Metrical Task Systems, introduced by Borodin et al. in [4]. In the extended definition, a system is described by the underlying metric space of states \({\cal M}\) as well as a set of allowable tasks \({\cal T}\) . Any request to an algorithm must be a member of \({\cal T}\) . The extension makes the model powerful enough to characterize completely many important on-line problems. We consider methods of designing competitive algorithms given the description of a system \(\langle {\cal M}, {\cal T} \rangle\) . In particular, we show that it is PSPACE-hard to determine the behavior of a \(c({\cal M},{\cal T})\) -competitive algorithm, where \(c({\cal M},{\cal T})\) is the best possible competitive ratio on \(\langle {\cal M},{\cal T} \rangle\) . In addition, we show a simple, polynomial-time algorithm for task systems \(\langle {\cal U}_n,{\cal T} \rangle\) (where \({\cal U}_n\) is the uniform metric space on n nodes) that achieves a competitive ratio of \(O( \log n \cdot c({\cal M},{\cal T}))\) .

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received January 30, 1995; revised February 13, 1996.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Burley, W., Irani, S. On Algorithm Design for Metrical Task Systems. Algorithmica 18, 461–485 (1997). https://doi.org/10.1007/PL00009166

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00009166

Navigation