Approximation and Online Algorithms

4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers

AvThomas Erlebach,Christos Kaklamanis

Häftad, Engelska, 2007

Del i serien Lecture Notes in Computer Science

551 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Approximation and Online Algorithms, WAOA 2006, held in Zurich, Switzerland in September 2006 as part of the ALGO 2006 conference event. The 26 revised full papers presented were carefully reviewed and selected from 62 submissions.

Produktinformation

Utgivningsdatum:2007-01-03
Mått:155 x 235 x 20 mm
Vikt:546 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:346
Upplaga:2007
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540695134

Utforska kategorier

Programmeringsböcker inom Data och IT

Innehållsförteckning

Approximation Algorithms for Scheduling Problems with Exact Delays.- Bidding to the Top: VCG and Equilibria of Position-Based Auctions.- Coping with Interference: From Maximum Coverage to Planning Cellular Networks.- Online Dynamic Programming Speedups.- Covering Many or Few Points with Unit Disks.- On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems.- Online k-Server Routing Problems.- Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem.- Improved Approximation Bounds for Edge Dominating Set in Dense Graphs.- A Randomized Algorithm for Online Unit Clustering.- On Hierarchical Diameter-Clustering, and the Supplier Problem.- Bin Packing with Rejection Revisited.- On Bin Packing with Conflicts.- Approximate Distance Queries in Disk Graphs.- Network Design with Edge-Connectivity and Degree Constraints.- Approximating Maximum Cut with Limited Unbalance.- Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems.- Improved Online Hypercube Packing.- Competitive Online Multicommodity Routing.- The k-Allocation Problem and Its Variants.- An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions.- Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set.- Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search.- Approximation Algorithms for Multi-criteria Traveling Salesman Problems.- The Survival of the Weakest in Networks.- Online Distributed Object Migration.

Du kanske också är intresserad av

Approximation and Online Algorithms

Christos Kaklamanis, Asaf Levin

Häftad

1 682 kr

Algorithms - ESA 2006

Yossi Azar, Thomas Erlebach

Häftad

1 095 kr

Approximation and Online Algorithms

Christos Kaklamanis, Kirk Pruhs

Häftad

430 kr

Network Analysis

Ulrik Brandes, Thomas Erlebach

Häftad

799 kr

Euro-Par 2016: Parallel Processing Workshops

Frédéric Desprez, Pierre-François Dutot, Christos Kaklamanis, Loris Marchal, Korbinian Molitorisz, Laura Ricci, Vittorio Scarano, Miguel A. Vega-Rodríguez, Ana Lucia Varbanescu, Sascha Hunold, Stephen L. Scott, Stefan Lankes, Josef Weidendorfer