Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Approximation and Online Algorithms: 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 Revised Papers > Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
Approximation and Online Algorithms: 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 Revised Papers |
Evripidis Bampis; Klaus Jansen
Springer Berlin Heidelberg
Approximation and Online Algorithms: 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 Revised Papers
Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
Authors

Elisabeth Günther; Felix G. König; Nicole Megow

ARI Id

1664845048239_3754769

Access

Not Available Free

Pages

170-181

DOI

10.1007/978-3-642-12450-1_16

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-642-12450-1_16

Table of Contents of Book
Showing 1 to 20 of 24 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems
Spyros Angelopoulos
1-12
Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications
Reuven Bar-Yehuda; Danny Hermelin; Dror Rawitz
13-24
Price Fluctuations: To Buy or to Rent
Marcin Bienkowski
25-36
Approximation Algorithms for Multiple Strip Packing
Marin Bougeret; Pierre Francois Dutot; Klaus Jansen; Christina Otte; Denis Trystram
37-48
Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window
Ho-Leung Chan; Tak-Wah Lam; Lap-Kei Lee; Hing-Fung Ting
49-61
Longest Wait First for Broadcast Scheduling [Extended Abstract]
Chandra Chekuri; Sungjin Im; Benjamin Moseley
62-74
The Routing Open Shop Problem: New Approximation Algorithms
Ilya Chernykh; Nikita Dryuck; Alexander Kononov; Sergey Sevastyanov
75-85
On the Price of Stability for Undirected Network Design
George Christodoulou; Christine Chung; Katrina Ligett; Evangelia Pyrga; Rob van Stee
86-97
Finding Dense Subgraphs in G(n, 1/2)
Atish Das Sarma; Amit Deshpande; Ravi Kannan
98-103
Parameterized Analysis of Paging and List Update Algorithms
Reza Dorrigiv; Martin R. Ehmsen; Alejandro López-Ortiz
104-115
Online Scheduling of Bounded Length Jobs to Maximize Throughput
Christoph Dürr; Łukasz Jeż; Kim Thang Nguyen
116-127
On the Additive Constant of the k-Server Work Function Algorithm
Yuval Emek; Pierre Fraigniaud; Amos Korman; Adi Rosén
128-134
A (4 + ε)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs
Thomas Erlebach; Matúš Mihalák
135-146
Guard Games on Graphs: Keep the Intruder Out!
Fedor V. Fomin; Petr A. Golovach; Daniel Lokshtanov
147-158
Between a Rock and a Hard Place: The Two-to-One Assignment Problem
Dries Goossens; Sergey Polyakovskiy; Frits C. R. Spieksma; Gerhard J. Woeginger
159-169
Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
Elisabeth Günther; Felix G. König; Nicole Megow
170-181
Online Minimization Knapsack Problem
Xin Han; Kazuhisa Makino
182-193
Optimization Problems in Multiple Subtree Graphs
Danny Hermelin; Dror Rawitz
194-204
Multi-Criteria TSP: Min and Max Combined
Bodo Manthey
205-216
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 24 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings