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

Published Berlin ; New York : Springer, ©2006

Click on the following:
Springer eBooks
Springer Computer Science eBooks

Copies

Description 1 online resource (vi, 347 pages) : illustrations Series Lecture notes in computer science, 0302-9743 ; 3484. State-of-the-art survey Lecture notes in computer science ; 3484. Lecture notes in computer science. State-of-the-art survey. 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 Summary "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 Analysis 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) Bibliography Includes bibliographical references and index Notes Print version record Subject Computer algorithms. Online algorithms. Combinatorial optimization -- Data processing Combinatorial optimization. Algorithms algorithms. 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 Combinatorial optimization -- Data processing Computer algorithms Online algorithms Approximationsalgorithmus Kombinatorische Optimierung Online-Algorithmus Form Electronic book Author Bampis, Evripidis Jansen, Klaus Kenyon, Claire ISBN 9783540322139 3540322132 3540322124 9783540322122

  Permalink