Efficient approximation and online algorithms : recent progress on classical combinatorial optimization problems and new applications / / Evripidis Bampis, Klaus Jansen, Claire Kenyon (eds.)
(Visualizza in formato marc)
(Visualizza in BIBFRAME)
| Titolo: |
Efficient approximation and online algorithms : recent progress on classical combinatorial optimization problems and new applications / / Evripidis Bampis, Klaus Jansen, Claire Kenyon (eds.)
|
| Pubblicazione: | New York, : Springer, 2006 |
| Edizione: | 1st ed. 2006. |
| Descrizione fisica: | 1 online resource (VII, 349 p.) |
| Disciplina: | 005.1 |
| Soggetto topico: | Computer algorithms |
| Online algorithms | |
| Combinatorial optimization - Data processing | |
| Altri autori: |
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. |
| Sommario/riassunto: | This book provides a good opportunity for computer science practitioners and researchers to get in sync with current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central idea in the book is to use a linear program relaxation of the problem, randomization and rounding techniques. |
| 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.: | 9910484229603321 |
| Lo trovi qui: | Univ. Federico II |
| Opac: | Controlla la disponibilità qui |
Serie:
Lecture notes in computer science ; ; 3484.
LNCS sublibrary. : SL 1, . -Theoretical computer science and general issues.