000 01803nmm a22004335u 4500
001 vtls000360457
003 RU-ToGU
005 20210922024946.0
007 cr nn 008mamaa
008 120828s2006 xx j eng d
020 _a9783540322139
035 _ato000360457
040 _aSpringer
_cSpringer
_dRU-ToGU
100 1 _aBampis, Evripidis.
_9323976
245 1 0 _aEfficient Approximation and Online Algorithms
_hЭлектронный ресурс
_bRecent Progress on Classical Combinatorial Optimization Problems and New Applications
_cedited by Evripidis Bampis, Klaus Jansen, Claire Kenyon.
260 _aBerlin Heidelberg :
_bSpringer-Verlag GmbH.,
_c2006
490 1 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v3484
650 0 _aAlgorithms
_9304813
650 0 _aComputational complexity
_9304814
650 0 _aComputer Communication Networks
_9566243
650 0 _aComputer graphics
_9281357
650 0 _aComputer software
_9303280
650 0 _aElectronic data processing
_9303503
650 1 4 _aComputer Science
_9155490
650 2 4 _aAlgorithm Analysis and Problem Complexity
_9303732
650 2 4 _aAlgorithms
_9304813
650 2 4 _aComputer Communication Networks
_9566243
650 2 4 _aComputer Graphics
_9281357
650 2 4 _aDiscrete Mathematics in Computer Science
_9304816
650 2 4 _aNumeric Computing
_9303733
700 1 _aJansen, Klaus
_9322568
700 1 _aKenyon, Claire
_9323978
710 2 _aSpringerLink (Online service)
_9143950
773 0 _tSpringer e-books
830 _aLecture Notes in Computer Science,
_9279505
856 4 0 _uhttp://dx.doi.org/10.1007/11671541
999 _c237426