000 | 01768nam a22004575i 4500 | ||
---|---|---|---|
001 | 978-3-540-85363-3 | ||
003 | DE-He213 | ||
005 | 20130515021800.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2008 gw | s |||| 0|eng d | ||
020 |
_a9783540853633 _9978-3-540-85363-3 |
||
024 | 7 |
_a10.1007/978-3-540-85363-3 _2doi |
|
050 | 4 | _aQA76.9.A43 | |
072 | 7 |
_aUMB _2bicssc |
|
072 | 7 |
_aCOM051300 _2bisacsh |
|
082 | 0 | 4 |
_a005.1 _223 |
100 | 1 | _aGoel, Ashish. | |
245 | 1 | 0 |
_aApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques _h[electronic resource] : _b11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings / _cedited by Ashish Goel, Klaus Jansen, José D. P. Rolim, Ronitt Rubinfeld. |
260 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2008. |
||
300 | _bdigital. | ||
490 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v5171 |
|
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer software. | |
650 | 0 | _aElectronic data processing. | |
650 | 0 | _aComputational complexity. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aNumeric Computing. |
700 | 1 | _aJansen, Klaus. | |
700 | 1 | _aRolim, José D. P. | |
700 | 1 | _aRubinfeld, Ronitt. | |
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540853626 |
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v5171 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-540-85363-3 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-LNC | ||
999 |
_c80737 _d80737 |