Approximation and online algorithms : 4th international workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006 : revised papers / / Thomas Erlebach, Christos Kaklamanis (eds.)

• Pubblicazione: Berlin, : Springer, c2006
• Edizione: 1st ed. 2007.
• Descrizione fisica: 1 online resource (X, 346 p.)
• Disciplina: 005.1
• Soggetto topico: Online algorithms; Mathematical optimization
• Altri autori: ErlebachThomas KaklamanisChristos
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: 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.
• Altri titoli varianti: WAOA 2006
• Titolo autorizzato: Approximation and online algorithms
• ISBN: 3-540-69514-1
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 9910484280403321
• Lo trovi qui: Univ. Federico II
• Serie: Lecture notes in computer science ; ; 4368.; LNCS sublibrary. : SL 1, . -Theoretical computer science and general issues.