Approximation and online algorithms
Subtitle: 7th international workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 ; revised papers
By: Evripidis Bampis, Klaus Jansen (eds.).
Contributors: Bampis, Evripidis; Jansen, Klaus
Series: Lecture notes in computer science -- 5893; Lecture notes in computer science -- 5893.; LNCS sublibrary
Publisher: Springer
Published: 2010
Place of publication: Berlin; New York
Language: eng
Number of pages: 254
ISBN-13: 9783642124495
Subjects: Approximation algorithms; Mathematical optimization; Congresses; Online algorithms
Other titles: WAOA 2009
Notes: International conference proceedings.

Includes bibliographical references and index.
Table of contents: title: On the competitiveness of the online asymmetric and Euclidean Steiner tree problems / Spyros Angelopoulos; title: Extension of the Nemhauser and Trotter Theorem to generalized vertex cover with applications / Reuven Bar-Yehuda, Danny Hermelin, and Dror Rawitz; title: Price fluctuations : to buy or to rent / Marcin Bienkowski; title: Approximation algorithms for multiple strip packing / Marin Bougeret, Pierre Francois Dutot, Klaus Jansen, Christina Otte, and Denis Trystram; title: Approximating frequent items in asynchronous data stream over a sliding window / Ho-Leung Chan, Tak-Wah Lam, Lap-Kei Lee, and Hing-Fung Ting; title: Longest wait first for broadcast scheduling (extended abastract) / Chandra Chekuri, Sungjin Im, and Benjamin Moseley; title: The routing open shop problem : new approximation algorithms / Ilya Chernykh, Nikita Dryuck, Alexander Kononov, and Sergey Sevastyanov; title: On the price of stability for undirected network design / George Christodoulou, Christine Chung, Katrina Ligett, Evangelia Pyrga, and Rob van Stee; title: Finding dense subgraphs in G(n, 1/2) / Atish Das Sarma, Amit Deshpande, and Ravi Kannan; title: Parameterized analysis of paging and list update algorithms / Reza Dorrigiv, Martin R. Ehmsen, and Alejandro López-Ortiz; title: Online scheduling of bounded length jobs to maximize throughput / Christoph Dürr, Łukasz Jeż, and Kim Thang Nguyen; title: On the additive constant of the k-server work function algorithm / Yuval Emek, Pierre Fraigniaud, Amos Korman, and Adi Rosén; title: A (4+e)-approximation for the minimum-weight dominating set problem in unit disk graphs / Thomas Erlebach and Matús̆ Mihalák; title: Guard games on graphs : keep the intruder out! / Fedor V. Fomin, Petr A. Golovach, and Daniel Lokshtanov; title: Between a rock and a hard place : the two-to-one assignment problem / Dries Goossens, Sergey Polyakovskiy, Frits C.R. Spieksma, and Gerhard J. Woeginger; title: Scheduling and packing malleable tasks with precedence constraints of bounded width / Elisabeth Günther, Felix G. König, and Nicole Megow; title: Online minimization knapsack problem / Xin Han and Kazuhisa Makino; title: Optimization problems in multiple subtree graphs / Danny Hermelin and Dror Rawitz; title: Multi-criteria TSP : min and max combined / Bodo Manthey; title: Packet routing : complexity and algorithms / Britta Peis, Martin Skutella, and Andreas Wiese; title: Minimal cost reconfiguration of data placement in storage area network / Hadas Shachnai, Gal Tamir, and Tami Tamir; title: Competitive multi-dimensional dynamic bin packing via L-shape bin packing / Prudence W.H. Wong and Fencol C.C. Yung.