MPG.eBooks - Table of Contents: Efficient Approximation and Online Algorithms

Read Now

Bibliographic Details
Other Authors:	Bampis, Evripidis (Editor), Jansen, Klaus (Editor), Kenyon, Claire (Editor)
Format:	eBook
Language:	English
Published:	Berlin, Heidelberg Springer Berlin Heidelberg 2006, 2006
Edition:	1st ed. 2006
Series:	Theoretical Computer Science and General Issues
Subjects:	Computer Communication Networks Computer Graphics Computer Science / Mathematics Numerical Analysis Discrete Mathematics In Computer Science Algorithms Computer Networks Discrete Mathematics
Online Access:	https://doi.org/10.1007/11671541?nosfx=y
Collection:	Springer eBooks 2005- - Collection details see MPG.ReNa

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