Approximation and Online Algorithms Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers /

The 2nd Workshop on Approximation and Online Algorithms (WAOA 2004) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications arising from a variety of ?elds. WAOA 2004 took place in Bergen, Norway, from...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Persiano, Giuseppe (Editor ), Solis-Oba, Roberto (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
Edición:1st ed. 2005.
Colección:Theoretical Computer Science and General Issues, 3351
Temas:
Algorithms.
Computer science > Mathematics.
Discrete mathematics.
Numerical analysis.
Computer graphics.
Artificial intelligence > Data processing.
Discrete Mathematics in Computer Science.
Numerical Analysis.
Computer Graphics.
Data Science.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • Invited Talks
  • Online Packet Switching
  • Approximation Algorithms for Mixed Fractional Packing and Covering Problems
  • Regular Papers
  • Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial k-Trees
  • Online Bin Packing with Resource Augmentation
  • A PTAS for Delay Minimization in Establishing Wireless Conference Calls
  • This Side Up!
  • Approximation Algorithm for Directed Multicuts
  • Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria
  • Approximation Algorithms for Spreading Points
  • More Powerful and Simpler Cost-Sharing Methods
  • Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints
  • Priority Algorithms for Graph Optimization Problems
  • Pricing Network Edges to Cross a River
  • Submodular Integer Cover and Its Application to Production Planning
  • Stochastic Online Scheduling on Parallel Machines
  • A -Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path
  • Order-Preserving Transformations and Greedy-Like Algorithms
  • Off-line Admission Control for Advance Reservations in Star Networks
  • Joint Base Station Scheduling
  • Universal Bufferless Routing
  • Strong Colorings of Hypergraphs
  • Deterministic Monotone Algorithms for Scheduling on Related Machines
  • Better Bounds for Minimizing SONET ADMs.

Ejemplares similares