WAOA B

27 papers

YearTitle / Authors
2006A Randomized Algorithm for Online Unit Clustering.
Timothy M. Chan, Hamid Zarrabi-Zadeh
2006An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions.
Jörg Knoche, Piotr Krysta
2006Approximate Distance Queries in Disk Graphs.
Martin Fürer, Shiva Prasad Kasiviswanathan
2006Approximating Maximum Cut with Limited Unbalance.
Giulia Galbiati, Francesco Maffioli
2006Approximating the Unweighted
Asaf Levin
2006Approximation Algorithms for Multi-criteria Traveling Salesman Problems.
Bodo Manthey, L. Shankar Ram
2006Approximation Algorithms for Scheduling Problems with Exact Delays.
Alexander A. Ageev, Alexander V. Kononov
2006Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers
Thomas Erlebach, Christos Kaklamanis
2006Bidding to the Top: VCG and Equilibria of Position-Based Auctions.
Gagan Aggarwal, Jon Feldman, S. Muthukrishnan
2006Bin Packing with Rejection Revisited.
Leah Epstein
2006Competitive Online Multicommodity Routing.
Tobias Harks, Stefan Heinz, Marc E. Pfetsch
2006Coping with Interference: From Maximum Coverage to Planning Cellular Networks.
David Amzallag, Joseph Naor, Danny Raz
2006Covering Many or Few Points with Unit Disks.
Mark de Berg, Sergio Cabello, Sariel Har-Peled
2006Improved Approximation Bounds for Edge Dominating Set in Dense Graphs.
Jean Cardinal, Stefan Langerman, Eythan Levy
2006Improved Online Hypercube Packing.
Xin Han, Deshi Ye, Yong Zhou
2006Network Design with Edge-Connectivity and Degree Constraints.
Takuro Fukunaga, Hiroshi Nagamochi
2006On Bin Packing with Conflicts.
Leah Epstein, Asaf Levin
2006On Hierarchical Diameter-Clustering, and the Supplier Problem.
Aparna Das, Claire Kenyon
2006On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems.
Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle
2006Online
Vincenzo Bonifaci, Leen Stougie
2006Online Distributed Object Migration.
David Scot Taylor
2006Online Dynamic Programming Speedups.
Amotz Bar-Noy, Mordecai J. Golin, Yan Zhang
2006Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set.
Petr Kolman, Tomasz Walen
2006The
Dorit S. Hochbaum, Asaf Levin
2006The Survival of the Weakest in Networks.
Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis
2006Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem.
Joan Boyar, Martin R. Ehmsen, Kim S. Larsen
2006Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems.
Gregory Z. Gutin, Boris Goldengorin, Jing Huang