TY  - BOOK
AU  - 
AU  - 
AU  - 
ED  - SpringerLink (Online service)
TI  - Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications 
T2  - Lecture Notes in Computer Science,
SN  - 9783540322139
AV  - Libro electrónico 
U1  - 005.1 23
PY  - 2006///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Computer Communication Networks
KW  - Computer software
KW  - Electronic data processing
KW  - Computational complexity
KW  - Computer graphics
KW  - Algorithms
KW  - Computer Science
KW  - Algorithm Analysis and Problem Complexity
KW  - Discrete Mathematics in Computer Science
KW  - Numeric Computing
KW  - Computer Graphics
N1  - 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 Lovsz-Local-Lemma and Scheduling; ZDB-2-SCS; ZDB-2-LNC
UR  - http://dx.doi.org/10.1007/11671541
ER  -