Cover image for Efficient Approximation and Online Algorithms Recent Progress on Classical Combinatorial Optimization Problems and New Applications
Efficient Approximation and Online Algorithms Recent Progress on Classical Combinatorial Optimization Problems and New Applications
Title:
Efficient Approximation and Online Algorithms Recent Progress on Classical Combinatorial Optimization Problems and New Applications
Author:
Bampis, Evripidis. editor.
ISBN:
9783540322139
Physical Description:
VII, 349 p. Also available online. online resource.
Series:
Lecture Notes in Computer Science, 3484
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.
Added Corporate Author:
Holds: Copies: