Efficient Approximation and Online Algorithms [electronic resource] : Recent Progress on Classical Combinatorial Optimization Problems and New Applications /
Material type: TextSeries: Theoretical Computer Science and General Issues ; 3484Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006Edition: 1st ed. 2006Description: VII, 349 p. online resourceContent type:- text
- computer
- online resource
- 9783540322139
- 518.1 23
- QA76.9.A43
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.
There are no comments on this title.