LEADER 01315nam--2200385---450-
001 990003071030203316
005 20080410125155.0
010   $a3-540-32212-4
035   $a000307103
035   $aUSA01000307103
035   $a(ALEPH)000307103USA01
035   $a000307103
100   $a20080227d2006----km-y0itay50------ba
101   $aeng
102   $aDE
105   $a||||||||001yy
200 1 $aEfficient approximation and online algorithms$eRecent progress on classical combinatorial optimization problems and new applications$fEvripidis Bampis, Klaus Jansen, Claire Kenyon (Eds.)
210   $aBerlin [etc.]$cSpringer$dcopyr. 2006
215   $aVI, 347 p.$cill.$d24 cm
225 2 $aLecture notes in computer science$iState-of-the-Art Survey$v3484
410  0$12001$aLecture notes in computer science$v3484
606 0 $aProgrammazione$xAlgoritmi
676   $a005.1
702  1$aBAMPIS,$bEvripidis
702  1$aJANSEN,$bKlaus
702  1$aKENYON,$bClaire
801  0$aITA$bsalbc$gISBD
912   $a990003071030203316
951   $a001 LNCS 3484$b33271/CBS$c001$d00217016
959   $aBK
969   $aSCI
979   $aANGELA$b90$c20080227$lUSA01$h1024
979   $aANGELA$b90$c20080410$lUSA01$h1251
996   $aEfficient Approximation and Online Algorithms$9772336
997   $aUNISA