Efficient approximation and online algorithms : recent progress on classical combinatorial optimization problems and new applications / Evripidis Bampis, Klaus Jansen, Claire Kenyon (eds.).

Contributor(s): Bampis, Evripidis | Jansen, Klaus | Kenyon, Claire
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 3484.; Lecture notes in computer science: Publisher: Berlin ; New York : Springer, ©2006Description: 1 online resource (vi, 347 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540322139; 3540322132; 3540322124; 9783540322122Subject(s): Computer algorithms | Online algorithms | Combinatorial optimization -- Data processing | Optimisation combinatoire | Algorithmes en ligne | COMPUTERS -- Programming -- Open Source | COMPUTERS -- Software Development & Engineering -- Tools | COMPUTERS -- Software Development & Engineering -- General | Combinatorial optimization -- Data processing | Optimisation combinatoire | Algorithmes en ligne | Computer algorithms | Online algorithms | Informatique | Combinatorial optimization -- Data processing | Computer algorithms | Online algorithms | Approximationsalgorithmus | Kombinatorische Optimierung | Online-Algorithmus | algoritmen | algorithms | computeranalyse | computer analysis | computergrafie | computer graphics | wiskunde | mathematics | computertechnieken | computer techniques | computerwetenschappen | computer sciences | computernetwerken | computer networks | numerieke methoden | numerical methods | Information and Communication Technology (General) | Informatie- en communicatietechnologie (algemeen)Genre/Form: Electronic books. | Electronic books. Additional physical formats: Print version:: Efficient approximation and online algorithms.DDC classification: 005.1 LOC classification: QA76.9.A43 | E38 2006ebOther classification: TP202 Online resources: Click here to access online
Contents:
On approximation algorithms for data mining applications / Foto N. Afrati -- A survey of approximation results for local search algorithms / Eric Angel -- Approximation algorithms for path coloring in trees / Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano -- Approximation algorithms for edge-disjoint paths and unsplittable flow / Thomas Erlebach -- Independence and coloring problems on intersection graphs of disks / Thomas Erlebach, Jiří Fiala -- Approximation algorithms for min-max and max-min resource sharing problems, and applications / Klaus Jansen -- A simpler proof of preemptive total flow time approximation on parallel machines / Stefano Leonardi -- Approximating a class of classification problems / Ioannis Milis -- List scheduling in order of [alpha]-points on a single machine / Martin Skutella -- Approximation algorithms for the k-median problem / Roberto Solis-Oba -- The Lovász-Local-Lemma and scheduling / Anand Srivastav.
Review: "This book provides a good opportunity for computer science practitioners and researchers to get in sync with the 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. This survey contains 11 papers that cover some classical problems of scheduling, of packing, and of graph theory, but also new optimization problems arising in various applications like networks, data mining or classification."--Jacket.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Includes bibliographical references and index.

On approximation algorithms for data mining applications / Foto N. Afrati -- A survey of approximation results for local search algorithms / Eric Angel -- Approximation algorithms for path coloring in trees / Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano -- Approximation algorithms for edge-disjoint paths and unsplittable flow / Thomas Erlebach -- Independence and coloring problems on intersection graphs of disks / Thomas Erlebach, Jiří Fiala -- Approximation algorithms for min-max and max-min resource sharing problems, and applications / Klaus Jansen -- A simpler proof of preemptive total flow time approximation on parallel machines / Stefano Leonardi -- Approximating a class of classification problems / Ioannis Milis -- List scheduling in order of [alpha]-points on a single machine / Martin Skutella -- Approximation algorithms for the k-median problem / Roberto Solis-Oba -- The Lovász-Local-Lemma and scheduling / Anand Srivastav.

"This book provides a good opportunity for computer science practitioners and researchers to get in sync with the 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. This survey contains 11 papers that cover some classical problems of scheduling, of packing, and of graph theory, but also new optimization problems arising in various applications like networks, data mining or classification."--Jacket.

Print version record.

There are no comments for this item.

to post a comment.

Powered by Koha