Efficient approximation and online algorithms

Auteurs

• Evripidis Bampis

Paramètres

• Mathématiques
• Lecture notes in computer science

En savoir plus sur le livre

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

Achat du livre

• Année de publication: 2006