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

List of contents

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.

Product details

• Assisted by: Evripidis Bampis (Editor), Klaus Jansen (Editor), Claire Kenyon (Editor)
• Publisher: Springer, Berlin
• Languages: English
• Product format: Paperback / Softback
• Released: 01.01.2006
• EAN: 9783540322122
• ISBN: 978-3-540-32212-2
• No. of pages: 348
• Dimensions: 155 mm x 20 mm x 235 mm
• Weight: 552 g
• Illustrations: VIII, 348 p.
• Series: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues
• Subjects: Natural sciences, medicine, IT, technology > Mathematics > Probability theory, stochastic theory, mathematical statistics; B, Algorithms, Grafikprogrammierung, Diskrete Mathematik, Netzwerk-Hardware, Mathematik für Informatiker, Numerische Mathematik, computer science, Computer Graphics, Computer Communication Networks, Discrete Mathematics in Computer Science, Discrete Mathematics, Numerical analysis, Mathematical theory of computation, Computer science—Mathematics, Maths for computer scientists, Algorithm Analysis and Problem Complexity, Graphics programming, Computer communication systems, Numeric Computing, Network hardware