Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Approximation and Online Algorithms: 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers > OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm
Approximation and Online Algorithms: 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers |
Roberto Solis-Oba; Giuseppe Persiano
Springer Berlin Heidelberg
Approximation and Online Algorithms: 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm
Authors

Gerth Stølting Brodal; Gabriel Moruz; Andrei Negoescu

ARI Id

1664923919266_4090111

Access

Not Available Free

Pages

164-175

DOI

10.1007/978-3-642-29116-6_14

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-642-29116-6_14

Table of Contents of Book
Showing 1 to 20 of 24 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Approximation Algorithms for Scheduling and Packing Problems
Klaus Jansen
1-8
Approximating Subset k-Connectivity Problems
Zeev Nutov
9-20
Learning in Stochastic Machine Scheduling
Sebastián Marbán; Cyriel Rutten; Tjark Vredeveld
21-34
An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems
Wolfgang Bein; Naoki Hatta; Nelson Hernandez-Cons; Hiro Ito; Shoji Kasahara; Jun Kawahara
35-48
Single Approximation for Biobjective Max TSP
Cristina Bazgan; Laurent Gourvès; Jérôme Monnot; Fanny Pascual
49-62
Parameterized Approximation Algorithms for Hitting Set
Ljiljana Brankovic; Henning Fernau
63-76
Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs
Nadine Schwartges; Joachim Spoerhase; Alexander Wolff
77-88
Optimization over Integers with Robustness in Cost and Few Constraints
Kai-Simon Goetzmann; Sebastian Stiller; Claudio Telha
89-101
A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption
Tomáš Ebenlendr; Jiří Sgall
102-108
Scheduling Jobs on Identical and Uniform Processors Revisited
Klaus Jansen; Christina Robenek
109-122
Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat
David B. Shmoys; Gwen Spencer
123-136
Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models
Jianqiao Zhu; Ho-Leung Chan; Tak-Wah Lam
137-149
A New Perspective on List Update: Probabilistic Locality and Working Set
Reza Dorrigiv; Alejandro López-Ortiz
150-163
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm
Gerth Stølting Brodal; Gabriel Moruz; Andrei Negoescu
164-175
Faster and Simpler Approximation of Stable Matchings
Katarzyna Paluch
176-187
Simpler 3/4-Approximation Algorithms for MAX SAT
Anke van Zuylen
188-197
On Online Algorithms with Advice for the k-Server Problem
Marc P. Renault; Adi Rosén
198-210
Improved Lower Bound for Online Strip Packing
Rolf Harren; Walter Kern
211-218
Competitive Router Scheduling with Structured Data
Yishay Mansour; Boaz Patt-Shamir; Dror Rawitz
219-232
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 24 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings