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žené v:
Podrobná bibliografia
Vydané v:Theoretical computer science Ročník 411; číslo 26; s. 2542 - 2558
Hlavní autori: Angelopoulos, Spyros, Borodin, Allan
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Oxford Elsevier B.V 06.06.2010
Elsevier
Predmet:
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 prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 randomized priority algorithms. As case studies, we prove inapproximation results for two well-studied optimization problems, namely facility location and makespan scheduling.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2010.03.014