Randomized priority algorithms

Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effect of randomization in greedy-like algorithms. More specifically, we consider approximation ratios within the context of r...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Theoretical computer science Ročník 411; číslo 26; s. 2542 - 2558
Hlavní autoři:	Angelopoulos, Spyros, Borodin, Allan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Oxford Elsevier B.V 06.06.2010 Elsevier
Témata:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Approximation C (programming language) Computer Science Computer science; control theory; systems Computer simulation Computer systems performance. Reliability Data Structures and Algorithms Exact sciences and technology Facility location Greedy algorithms Makespan scheduling Mathematical analysis Miscellaneous Optimization Priorities Randomization Randomized approximation algorithms Scheduling Software Theoretical computing Greedy algorithms Facility location Randomized approximation algorithms Makespan scheduling Approximation Computer theory Priority Optimization method Scheduling Makespan Approximation algorithm Modeling Location problem Case study Randomization Greedy algorithm 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!