Notice bibliographique
- Notice
Type(s) de contenu et mode(s) de consultation : Texte noté : électronique
Auteur(s) : WAOA 2011 (2011 ; Saarbrücken, Germany)
Titre(s) : Approximation and online algorithms [Texte électronique] : 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, revised selected papers / Roberto Solis-Oba, Giuseppe Persiano (Eds.)
Publication : Heidelberg ; New York : Springer, [2012]
Description matérielle : 1 ressource dématérialisée
Collection : Lecture notes in computer science ; 7164
LNCS sublibrary. SL 1, Theoretical computer science and general issues
Note(s) : Includes bibliographical references and author index
Annotation This book constitutes the thoroughly refereed post-proceedings of the 9th
International Workshop on Approximation and Online Algorithms, WAOA 2011, held in
Saarbrücken, Germany, in September 2011. The 21 papers presented were carefully reviewed
and selected from 48 submissions. The volume also contains an extended abstract of
the invited talk of Prof. Klaus Jansen. The Workshop on Approximation and Online Algorithms
focuses on the design and analysis of algorithms for online and computationally hard
problems. Both kinds of problems have a large number of applicationsin a wide variety
of fields. Topics of interest for WAOA 2011 were: algorithmic game theory, approximation
classes, coloring and partitioning, competitive analysis, computational finance, cuts
and connectivity, geometric problems, inapproximability results, mechanism design,
network design, packing and covering, paradigms for design and analysis of approximation
and online algorithms, parameterized complexity, randomization techniques and scheduling
problems
Autre(s) auteur(s) : Solis-Oba, Roberto. Fonction indéterminée
Persiano, Giuseppe. Fonction indéterminée
Autre(s) forme(s) du titre :
- Autre forme du titre : WAOA 2011
Sujet(s) : Algorithmes d'approximation
Indice(s) Dewey :
005.1 (23e éd.) = Développement de logiciels
Identifiants, prix et caractéristiques : ISBN 9783642291166
Identifiant de la notice : ark:/12148/cb44704248r
Notice n° :
FRBNF44704248
(notice reprise d'un réservoir extérieur)
Table des matières : Approximation Algorithms for Scheduling and Packing Problems /Klaus Jansen ; Approximating
Subset k-Connectivity Problems /Zeev Nutov ; Learning in Stochastic Machine Scheduling
/Sebastiâan Marbâan, Cyriel Rutten and Tjark Vredeveld ; An Online Algorithm Optimally
Self-tuning to Congestion for Power Management Problems /Wolfgang Bein, Naoki Hatta,
Nelson Hernandez-Cons, Hiro Ito and Shoji Kasahara, et al. ; Single Approximation
for Biobjective Max TSP /Cristina Bazgan, Laurent Gourváes, Jâerãome Monnot and Fanny
Pascual ; Parameterized Approximation Algorithms for Hitting Set /Ljiljana Brankovic
and Henning Fernau ; Approximation Algorithms for the Maximum Leaf Spanning Tree Problem
on Acyclic Digraphs /Nadine Schwartges, Joachim Spoerhase and Alexander Wolff ; Optimization
over Integers with Robustness in Cost and Few Constraints /Kai-Simon Goetzmann, Sebastian
Stiller and Claudio Telha ; A Lower Bound on Deterministic Online Algorithms for Scheduling
on Related Machines without Pree
Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located
Threat /David B. Shmoys and Gwen Spencer ; Non-clairvoyant Weighted Flow Time Scheduling
on Different Multi-processor Models /Jianqiao Zhu, Ho-Leung Chan and Tak-Wah Lam ;
A New Perspective on List Update: Probabilistic Locality and Working Set /Reza Dorrigiv
and Alejandro Lâopez-Ortiz ; OnlineMin: A Fast Strongly Competitive Randomized Paging
Algorithm /Gerth St²lting Brodal, Gabriel Moruz and Andrei Negoescu ; Faster and Simpler
Approximation of Stable Matchings /Katarzyna Paluch ; Simpler 3/4-Approximation Algorithms
for MAX SAT /Anke van Zuylen ; On Online Algorithms with Advice for the k-Server Problem
/Marc P. Renault and Adi Rosâen ; Improved Lower Bound for Online Strip Packing /(Extended
Abstract)Rolf Harren and Walter Kern ; Competitive Router Scheduling with Structured
Data /Yishay Mansour, Boaz Patt-Shamir and Dror Rawitz ; Approximation with a Fixed
Number of Solutions of Some Biobjective Maximiza
