Efficient Approximation and Online Algorithms [[electronic resource] ] : Recent Progress on Classical Combinatorial Optimization Problems and New Applications / / edited by Evripidis Bampis, Klaus Jansen, Claire Kenyon

• Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
• Edizione: 1st ed. 2006.
• Descrizione fisica: 1 online resource (VII, 349 p.)
• Disciplina: 005.1
• Soggetto topico: Algorithms; Computer science—Mathematics; Discrete mathematics; Numerical analysis; Computer networks; Computer graphics; Discrete Mathematics in Computer Science; Numerical Analysis; Computer Communication Networks; Computer Graphics
• Persona (resp. second.): BampisEvripidis; JansenKlaus; KenyonClaire
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: 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.
• Titolo autorizzato: Efficient Approximation and Online Algorithms
• ISBN: 3-540-32213-2
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 996466155203316
• Lo trovi qui: Univ. di Salerno
• Serie: Theoretical Computer Science and General Issues, . 2512-2029 ; ; 3484