Efficient Approximation and Online Algorithms Recent Progress on Classical Combinatorial Optimization Problems and New Applications /

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Bampis, Evripidis (Editor ), Jansen, Klaus (Editor ), Kenyon, Claire (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
Edición:1st ed. 2006.
Colección:Theoretical Computer Science and General Issues, 3484
Temas:
Algorithms.
Computer science-Mathematics.
Discrete mathematics.
Numerical analysis.
Computer networks .
Computer graphics.
Discrete Mathematics in Computer Science.
Numerical Analysis.
Computer Communication Networks.
Computer Graphics.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • Contributed Talks
  • On Approximation Algorithms for Data Mining Applications
  • A Survey of Approximation Results for Local Search Algorithms
  • Approximation Algorithms for Path Coloring in Trees
  • Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow
  • Independence and Coloring Problems on Intersection Graphs of Disks
  • Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications
  • A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines
  • Approximating a Class of Classification Problems
  • List Scheduling in Order of ?-Points on a Single Machine
  • Approximation Algorithms for the k-Median Problem
  • The Lovász-Local-Lemma and Scheduling.

Ejemplares similares