|
|
|
|
LEADER |
02149nmm a2200385 u 4500 |
001 |
EB000375345 |
003 |
EBX01000000000000000228397 |
005 |
00000000000000.0 |
007 |
cr||||||||||||||||||||| |
008 |
130626 ||| eng |
020 |
|
|
|a 9783540322139
|
100 |
1 |
|
|a Bampis, Evripidis
|e [editor]
|
245 |
0 |
0 |
|a Efficient Approximation and Online Algorithms
|h Elektronische Ressource
|b Recent Progress on Classical Combinatorial Optimization Problems and New Applications
|c edited by Evripidis Bampis, Klaus Jansen, Claire Kenyon
|
250 |
|
|
|a 1st ed. 2006
|
260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2006, 2006
|
300 |
|
|
|a VII, 349 p
|b online resource
|
505 |
0 |
|
|a 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
|
653 |
|
|
|a Computer Communication Networks
|
653 |
|
|
|a Computer graphics
|
653 |
|
|
|a Computer science / Mathematics
|
653 |
|
|
|a Numerical Analysis
|
653 |
|
|
|a Discrete Mathematics in Computer Science
|
653 |
|
|
|a Computer Graphics
|
653 |
|
|
|a Algorithms
|
653 |
|
|
|a Computer networks
|
653 |
|
|
|a Numerical analysis
|
653 |
|
|
|a Discrete mathematics
|
700 |
1 |
|
|a Jansen, Klaus
|e [editor]
|
700 |
1 |
|
|a Kenyon, Claire
|e [editor]
|
041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
490 |
0 |
|
|a Theoretical Computer Science and General Issues
|
028 |
5 |
0 |
|a 10.1007/11671541
|
856 |
4 |
0 |
|u https://doi.org/10.1007/11671541?nosfx=y
|x Verlag
|3 Volltext
|
082 |
0 |
|
|a 518.1
|