Willkommen, schön sind Sie da!
Logo Ex Libris

Approximation and Online Algorithms

  • E-Book (pdf)
  • 349 Seiten
(0) Erste Bewertung abgeben
Bewertungen
(0)
(0)
(0)
(0)
(0)
Alle Bewertungen ansehen
This book constitutes the thoroughly refereed post-proceedings of the Third International Workshop on Approximation and Online Al... Weiterlesen
E-Books ganz einfach mit der kostenlosen Ex Libris-Reader-App lesen. Hier erhalten Sie Ihren Download-Link.
CHF 100.00
Download steht sofort bereit
Informationen zu E-Books
E-Books eignen sich auch für mobile Geräte (sehen Sie dazu die Anleitungen).
E-Books von Ex Libris sind mit Adobe DRM kopiergeschützt: Erfahren Sie mehr.
Weitere Informationen finden Sie hier.
Bestellung & Lieferung in eine Filiale möglich

Beschreibung

This book constitutes the thoroughly refereed post-proceedings of the Third International Workshop on Approximation and Online Algorithms, held in Palma de in October 2005. The 26 revised full papers presented were carefully reviewed and selected from 68 submissions. Topics addressed by the workshop include algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, and mechanism design.



Inhalt

"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.

Produktinformationen

Titel: Approximation and Online Algorithms
Untertitel: Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Selected Papers
Editor:
EAN: 9783540322085
Digitaler Kopierschutz: Wasserzeichen
Format: E-Book (pdf)
Hersteller: Springer Berlin Heidelberg
Genre: IT & Internet
Anzahl Seiten: 349
Veröffentlichung: 16.02.2006
Dateigrösse: 4.5 MB

Weitere Bände aus der Buchreihe "Theoretical Computer Science and General Issues"