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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Theoretical computer science Ročník 341; číslo 1; s. 216 - 246
Hlavní autoři:	Schäfer, Guido, Sivadasan, Naveen
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 05.09.2005 Elsevier
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!