Personal tools
You are here: Home WAOA Accepted Papers

Accepted Papers

List of accepted papers for WAOA 2006.


Alexander A. Ageev and Alexander V. Kononov
Approximation Algorithms for Scheduling Problems with Exact Delays

Gagan Aggarwal, Jon Feldman and S. Muthukrishnan
Bidding to the Top: VCG and Equilibria of Position-Based Auctions

David Amzallag, Seffi Naor and Danny Raz
Coping with Interferences: From Maximum Coverage to Planning Cellular Networks

Amotz Bar-Noy, Mordecai Golin and Yan Zhang
Online Dynamic Programming Speedups

Mark de Berg, Sergio Cabello and Sariel Har-Peled
Covering Many of Few Points with Unit Disks

Hans Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, Rene Sitters and Thomas Wolle
On the minimum corridor connection problem and other generalized geometric problems

Vincenzo Bonifaci and Leen Stougie
Online k-server routing problems

Joan Boyar, Martin R. Ehmsen and Kim S. Larsen
Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem

Jean Cardinal, Stefan Langerman and Eythan Levy
Improved Approximation Bounds for Edge Dominating Set in Dense Graphs

Timothy Chan and Hamid Zarrabi-Zadeh
A Randomized Algorithm for Online Unit Clustering

Aparna Das and Claire Kenyon
On hierarchical diameter-clustering, and the supplier problems

Leah Epstein
Bin packing with rejection revisited

Leah Epstein and Asaf Levin
On bin packing with conflicts

Takuro Fukunaga and Hiroshi Nagamochi
Network Design with Edge-Connectivity and Degree Constraints

Martin Furer and Shiva Kasiviswanathan
Approximate Distance Queries in Disk Graphs

Giulia Galbiati and Francesco Maffioli
Approximating Maximum Cut with Limited Unbalance

Gregory Gutin, Boris Goldengorin and Jing Huang
Worst Case Analysis of Max-Regret and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems

Xin Han, Deshi Ye and Yong Zhou
Improved online hypercube packing

Tobias Harks, Stefan Heinz and Marc E. Pfetsch
Competitive Online Multicommodity Routing

Dorit S. Hochbaum and Asaf Levin
The k-allocation problem and its variants

Petr Kolman and Tomasz Walen
Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set

Piotr Krysta and Joerg Knoche
An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions

Asaf Levin
Approximating the unweighted k-set cover problem: greedy meets local search

Bodo Manthey and L. Shankar Ram
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems

Sotiris Nikoletseas, Christoforos Raptopoulos and Paul Spirakis
The survival of the weakest in networks

David Scot Taylor
Online Distributed Object Migration

Document Actions