Approximation and online algorithms - Info and Reading Options

"Approximation and online algorithms" Table Of Contents:

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

Read “Approximation and online algorithms”:

Read “Approximation and online algorithms” by choosing from the options below.