8. WAOA 2010: Liverpool, UK

• Elliot Anshelevich, Bugra Caskurlu, Ameya Hate:
  Strategic Multiway Cut and Multicut Games. 1-12
  
• Spyridon Antonakopoulos:
  Approximating Directed Buy-at-Bulk Network Design. 13-24
  
• János Balogh, József Békési, Gábor Galambos:
  New Lower Bounds for Certain Classes of Bin Packing Algorithms. 25-36
  
• Magnus Bordewich:
  On the Approximation Complexity Hierarchy. 37-46
  
• Patrick Briest, Heiko Röglin:
  The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers. 47-58
  
• Ho-Leung Chan, Tak Wah Lam, Rongbin Li:
  Tradeoff between Energy and Throughput for Online Deadline Scheduling. 59-70
  
• Chandra Chekuri, Avigdor Gal, Sungjin Im, Samir Khuller, Jian Li, Richard Matthew McCutchen, Benjamin Moseley, Louiqa Raschid:
  New Models and Algorithms for Throughput Maximization in Broadcast Scheduling - (Extended Abstract). 71-82
  
• Danny Z. Chen, Rudolf Fleischer, Jian Li:
  Densest k-Subgraph Approximation on Intersection Graphs. 83-93
  
• Aparna Das, Claire Mathieu, Shay Mozes:
  The Train Delivery Problem - Vehicle Routing Meets Bin Packing. 94-105
  
• Daniel Dressler, Martin Skutella:
  An FPTAS for Flows over Time with Aggregate Arc Capacities. 106-117
  
• Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen:
  List Factoring and Relative Worst Order Analysis. 118-129
  
• Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
  Approximation Algorithms for Domination Search. 130-141
  
• Caroline Jagtenberg, Uwe Schwiegelshohn, Marc Uetz:
  Lower Bounds for Smith's Rule in Stochastic Machine Scheduling. 142-153
  
• Lior Kamma, Zeev Nutov:
  Approximating Survivable Networks with Minimum Number of Steiner Points. 154-165
  
• Andreas Karrenbauer, Thomas Rothvoß:
  A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks. 166-177
  
• Tak Wah Lam, Chi-Man Liu, Hing-Fung Ting:
  Online Tracking of the Dominance Relationship of Distributed Multi-dimensional Data. 178-189
  
• Konstantin Makarychev, Yury Makarychev:
  How to Play Unique Games on Expanders. 190-200
  
• Claire Mathieu, Adrian Vladu:
  Online Ranking for Tournament Graphs. 201-212
  
• Britta Peis, Andreas Wiese:
  Throughput Maximization for Periodic Packet Routing on Trees and Grids. 213-224
  
• David Pritchard:
  k-Edge-Connectivity: Approximation and LP Relaxation. 225-236
  
• Kirk Pruhs, Julien Robert, Nicolas Schabanel:
  Minimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability. 237-248
  
• Rob van Stee:
  An Improved Algorithm for Online Rectangle Filling. 249-260
  
• Tomoyuki Yamakami:
  Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems. 261-272
  

Last update Fri May 25 08:47:41 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page