Efficient Approximation and Online Algorithms Recent Progress on Classical Combinatorial Optimization Problems and New Applications / [electronic resource] :
edited by Evripidis Bampis, Klaus Jansen, Claire Kenyon.
- 1st ed. 2006.
- VII, 349 p. online resource.
- Theoretical Computer Science and General Issues, 3484 2512-2029 ; .
- Theoretical Computer Science and General Issues, 3484 .
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.
9783540322139
10.1007/11671541 doi
Algorithms.
Computer science--Mathematics.
Discrete mathematics.
Numerical analysis.
Computer networks .
Computer graphics.
Algorithms.
Discrete Mathematics in Computer Science.
Numerical Analysis.
Computer Communication Networks.
Computer Graphics.
QA76.9.A43
518.1
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.
9783540322139
10.1007/11671541 doi
Algorithms.
Computer science--Mathematics.
Discrete mathematics.
Numerical analysis.
Computer networks .
Computer graphics.
Algorithms.
Discrete Mathematics in Computer Science.
Numerical Analysis.
Computer Communication Networks.
Computer Graphics.
QA76.9.A43
518.1