WAOA04 list of accepted papers

 

Title Authors
Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial $k$-trees Daniel Marx
Online bin packing with resource augmentation Leah Epstein and Rob van Stee
A PTAS for Delay Minimization in Establishing Wireless Conference Calls Leah Epstein and Asaf Levin
Better bounds for minimizing SONET ADMs Leah Epstein and Asaf Levin
This side up! Leah Epstein and Rob van Stee
Approximating directed multicuts Y. Kortsarts, G. Kortsarz, and Z. Nutov
Improved Bounds for Sum Multicoloring and Weighted Completion Time of Dependent Jobs Rajiv Gandhi, M. Halldorsson, G. Kortsarz, and H. Shachnai.
Approximation Algorithms for Spreading Points S. Cabello
More Powerful and Simpler Cost-Sharing Methods P. Penna and C. Ventre
Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints H. Shachnai, O. Shmueli and R. Sayegh,
Priority Algorithms for Graph Optimization Problems A. Borodin, J. Boyar, and K. S. Larsen
Pricing Network Edges to Cross a River A. Grigoriev, S. van Hoesel, A. F. van der Kraaij, M. Uetz, and M. Bouhtou
Submodular Integer Cover and its Application to Production Planning T. Fujito and T. Yabuta
Stochastic Online Scheduling on Parallel Machines N. Megow, M. Uetz, and T. Vredeveld,
A 5/4-approximation algorithm for biconnecting a graph with a given Hamiltonian path D. Bilo and G. Proietti
Ordering-Preserving Transformations and Greedy-like Algorithms S. Angelopoulos
Off-line Admission Control for Advance Reservations in Star Networks U. Adamy, T. Erlebach, D. Mitsche, I. Schurr, B. Speckmann, E. Welzl
Joint Base Station Scheduling T. Erlebach, R. Jacob, M. Mihalak, M. Nunkesser, G. Szabo, P. Widmayer
Universal Bufferless Routing C. Busch, M. Magdon-Ismail, M. Mavronicolas
Strong Colorings of Hypergraphs G. Agnarsson and M. M. Halldorsson
Deterministic Monotone Algortihms for Scheduling on Related Machines P. Ambrosio and V. Auletta