| Record ID | marc_loc_updates/v37.i44.records.utf8:4078718:1047 |
| Source | Library of Congress |
| Download Link | /show-records/marc_loc_updates/v37.i44.records.utf8:4078718:1047?format=raw |
LEADER: 01047nam a22002894a 4500
001 2006920093
003 DLC
005 20091027115552.0
008 060104s2006 nyua b 001 0 eng
010 $a 2006920093
020 $a9783540322139 (softcover : alk. paper)
020 $a3540322132 (softcover : alk. paper)
040 $aDLC$cDLC
042 $apcc
050 00 $aQA76.9.A43$bE44 2006
245 00 $aEfficient approximation and online algorithms :$brecent progress on classical combinatorical optimization problems and new applications /$c[edited by] Evripidis Bampis, Klaus Jansen, Claire Kenyon.
250 $a1st ed.
260 $aNew York :$bSpringer,$c2006.
300 $avi, 347 p. :$bill. ;$c24 cm.
490 0 $aLecture notes in computer science ;$v3484
504 $aIncludes bibliographical references and index.
650 0 $aComputer algorithms.
650 0 $aOnline algorithms.
650 0 $aCombinatorial optimization$xData processing.
700 1 $aBampis, Evripidis.
700 1 $aJansen, Klaus.
700 1 $aKenyon, Claire.