2. WAOA 2004: Bergen, Norway

Invited Talks

• Yossi Azar:
  Online Packet Switching. 1-5
  
• Klaus Jansen:
  Approximation Algorithms for Mixed Fractional Packing and Covering Problems. 6-8
  

Regular Papers

• Dániel Marx:
  Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial k-Trees. 9-22
  
• Leah Epstein, Rob van Stee:
  Online Bin Packing with Resource Augmentation. 23-35
  
• Leah Epstein, Asaf Levin:
  A PTAS for Delay Minimization in Establishing Wireless Conference Calls. 36-47
  
• Leah Epstein, Rob van Stee:
  This Side Up! 48-60
  
• Yana Kortsarts, Guy Kortsarz, Zeev Nutov:
  Approximation Algorithm for Directed Multicuts. 61-67
  
• Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
  Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria. 68-82
  
• Sergio Cabello:
  Approximation Algorithms for Spreading Points. 83-96
  
• Paolo Penna, Carmine Ventre:
  More Powerful and Simpler Cost-Sharing Methods. 97-110
  
• Hadas Shachnai, Oded Shmueli, Robert Sayegh:
  Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints. 111-125
  
• Allan Borodin, Joan Boyar, Kim S. Larsen:
  Priority Algorithms for Graph Optimization Problems. 126-139
  
• Alexander Grigoriev, Stan P. M. van Hoesel, Anton F. van der Kraaij, Marc Uetz, Mustapha Bouhtou:
  Pricing Network Edges to Cross a River. 140-153
  
• Toshihiro Fujito, Takatoshi Yabuta:
  Submodular Integer Cover and Its Application to Production Planning. 154-166
  
• Nicole Megow, Marc Uetz, Tjark Vredeveld:
  Stochastic Online Scheduling on Parallel Machines. 167-180
  
• Davide Bilò, Guido Proietti:
  A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path. 181-196
  
• Spyros Angelopoulos:
  Order-Preserving Transformations and Greedy-Like Algorithms. 197-210
  
• Udo Adamy, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl:
  Off-line Admission Control for Advance Reservations in Star Networks. 211-224
  
• Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer:
  Joint Base Station Scheduling. 225-238
  
• Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas:
  Universal Bufferless Routing. 239-252
  
• Geir Agnarsson, Magnús M. Halldórsson:
  Strong Colorings of Hypergraphs. 253-266
  
• Pasquale Ambrosio, Vincenzo Auletta:
  Deterministic Monotone Algorithms for Scheduling on Related Machines. 267-280
  
• Leah Epstein, Asaf Levin:
  Better Bounds for Minimizing SONET ADMs. 281-294