Topology matters: Smoothed competitiveness of metrical task systems

Borodin et al. (J. ACM 39 (1992) 745) introduced metrical task systems, a framework to model a large class of online problems. Metrical task systems can be described as follows. We are given a graph G = ( V , E ) with n nodes and a positive edge length λ ( e ) for every edge e ∈ E . An online algori...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 341; no. 1; pp. 216 - 246
Main Authors:	Schäfer, Guido, Sivadasan, Naveen
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 05.09.2005 Elsevier
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Combinatorics Combinatorics. Ordered structures Competitive analysis Computer science; control theory; systems Exact sciences and technology Graph theory Mathematics Metrical task systems Online algorithms Sciences and techniques of general use Smoothed analysis Theoretical computing Work function algorithm Work function algorithm Metrical task systems Online algorithms Smoothed analysis Competitive analysis Lower bound Smoothing methods Computer theory Asymptotic behavior Competitiveness Shortest path Metrical task system Online algorithm Topology Competitive algorithms Upper bound Standard deviation Deterministic algorithms
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!