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

• Corporate Author: SpringerLink (Online service)
• Other Authors: Bampis, Evripidis (Editor), Jansen, Klaus (Editor), Kenyon, Claire (Editor)
• Format: Electronic eBook
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006.
• Series: Lecture Notes in Computer Science, 3484
• Subjects: Computer science.; Computer communication systems.; Algorithms.; Numerical analysis.; Computer science > Mathematics.; Computer graphics.; Computer Science.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; Numeric Computing.; Computer Communication Networks.; Computer Graphics.

Table 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.