Approximation and Online Algorithms: Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Papers: 3879 - Brossura

 
9783540322078: Approximation and Online Algorithms: Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Papers: 3879
Brossura
ISBN 10: 3540322078 ISBN 13: 9783540322078
Casa editrice: Springer, 2006

Sinossi

This book constitutes the thoroughly refereed post proceedings of the Third International Workshop on Approximation and Online Algorithms, WAOA 2005, held in Palma de Mallorca, Spain in October 2005 as part of the ALGO 2005 event. The 26 revised full papers presented were carefully reviewed and selected from 68 submissions. Topics addressed by the workshop are algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms, randomization techniques, real-world applications, and scheduling problems.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Contenuti

“Almost Stable” Matchings in the Roommates Problem.- On the Minimum Load Coloring Problem.- Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT.- The Hardness of Network Design for Unsplittable Flow with Selfish Users.- Improved Approximation Algorithm for Convex Recoloring of Trees.- Exploiting Locality: Approximating Sorting Buffers.- Approximate Fair Cost Allocation in Metric Traveling Salesman Games.- Rounding of Sequences and Matrices, with Applications.- A Note on Semi-online Machine Covering.- SONET ADMs Minimization with Divisible Paths.- The Conference Call Search Problem in Wireless Networks.- Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents.- Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost.- A Better-Than-Greedy Algorithm for k-Set Multicover.- Deterministic Online Optical Call Admission Revisited.- Scheduling Parallel Jobs with Linear Speedup.- Online Removable Square Packing.- The Online Target Date Assignment Problem.- Approximation and Complexity of k–Splittable Flows.- On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem.- Tighter Approximations for Maximum Induced Matchings in Regular Graphs.- On Approximating Restricted Cycle Covers.- A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs.- Speed Scaling of Tasks with Precedence Constraints.- Partial Multicuts in Trees.- Approximation Schemes for Packing with Item Fragmentation.

Product Description

Book by None

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Editore
Springer
Data di pubblicazione
2006
Lingua
Inglese
ISBN 10 
3540322078
ISBN 13 
9783540322078
Rilegatura
Copertina flessibile
Numero di pagine
364
Redattore
Erlebach Thomas
Contatto del produttore
non disponibile
Persona responsabile
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Germania