000 | 03071nam a22006135i 4500 | ||
---|---|---|---|
001 | 978-3-540-32213-9 | ||
003 | DE-He213 | ||
005 | 20240423125915.0 | ||
007 | cr nn 008mamaa | ||
008 | 100714s2006 gw | s |||| 0|eng d | ||
020 |
_a9783540322139 _9978-3-540-32213-9 |
||
024 | 7 |
_a10.1007/11671541 _2doi |
|
050 | 4 | _aQA76.9.A43 | |
072 | 7 |
_aUMB _2bicssc |
|
072 | 7 |
_aCOM051300 _2bisacsh |
|
072 | 7 |
_aUMB _2thema |
|
082 | 0 | 4 |
_a518.1 _223 |
245 | 1 | 0 |
_aEfficient Approximation and Online Algorithms _h[electronic resource] : _bRecent Progress on Classical Combinatorial Optimization Problems and New Applications / _cedited by Evripidis Bampis, Klaus Jansen, Claire Kenyon. |
250 | _a1st ed. 2006. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2006. |
|
300 |
_aVII, 349 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v3484 |
|
505 | 0 | _aContributed 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. | |
650 | 0 | _aAlgorithms. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 0 | _aNumerical analysis. | |
650 | 0 | _aComputer networks . | |
650 | 0 | _aComputer graphics. | |
650 | 1 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aNumerical Analysis. |
650 | 2 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aComputer Graphics. |
700 | 1 |
_aBampis, Evripidis. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aJansen, Klaus. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aKenyon, Claire. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540322122 |
776 | 0 | 8 |
_iPrinted edition: _z9783540820475 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v3484 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/11671541 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c182967 _d182967 |