It looks like you're offline.
Open Library logo
additional options menu

MARC record from Internet Archive

LEADER: 08253cam 2201105Ia 4500
001 ocn262677895
003 OCoLC
005 20200704044002.0
008 081017s2005 gw a ob 101 0 eng d
006 m o d
007 cr cn|||||||||
040 $aGW5XE$beng$epn$cGW5XE$dQCL$dOHX$dCOO$dYNG$dNUI$dOCLCQ$dN$T$dMND$dE7B$dOCLCO$dOCLCQ$dOCLCF$dBEDGE$dOCLCQ$dITD$dOCLCO$dYDXCP$dIDEBK$dOCLCQ$dOCL$dOCLCO$dOCLCQ$dEBLCP$dLWU$dVT2$dOCLCQ$dESU$dU3W$dBUF$dUAB$dOCLCQ$dTFW$dOCLCO$dQE2$dWYU$dICG$dOCLCQ
019 $a58041790$a222314450$a288241087$a613648479$a710992305$a739135557$a767168704$a785777561$a829821655$a956916749$a964910739$a1005831032$a1051444311
020 $a9783540318330
020 $a354031833X
020 $a354024574X
020 $a9783540245742
024 4 $a9783540245742
035 $a(OCoLC)262677895$z(OCoLC)58041790$z(OCoLC)222314450$z(OCoLC)288241087$z(OCoLC)613648479$z(OCoLC)710992305$z(OCoLC)739135557$z(OCoLC)767168704$z(OCoLC)785777561$z(OCoLC)829821655$z(OCoLC)956916749$z(OCoLC)964910739$z(OCoLC)1005831032$z(OCoLC)1051444311
037 $a978-3-540-24574-2$bSpringer$nhttp://www.springerlink.com
050 4 $aQA76.9.A43$bW42 2004
055 12 $aQA76.9*
055 10 $aQA76 .9 A43$bW42 2004
072 7 $aQA$2lcco
072 7 $aCOM$x051390$2bisacsh
072 7 $aCOM$x051440$2bisacsh
072 7 $aCOM$x051230$2bisacsh
082 04 $a005.1$222
084 $a54.10$2bcl
111 2 $aWAOA 2004$d(2004 :$cBergen, Norway)
245 10 $aApproximation and online algorithms :$bsecond international workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004 : revised selected papers /$cGiuseppe Persiano, Roberto Solis-Oba (eds.).
246 30 $aWAOA 2004
260 $aBerlin ;$aNew York :$bSpringer,$c©2005.
300 $a1 online resource (viii, 294 pages) :$billustrations
336 $atext$btxt$2rdacontent
337 $acomputer$bc$2rdamedia
338 $aonline resource$bcr$2rdacarrier
490 1 $aLecture notes in computer science,$x0302-9743 ;$v3351
504 $aIncludes bibliographical references and index.
588 0 $aPrint version record.
505 0 $aInvited Talks -- Online Packet Switching -- Approximation Algorithms for Mixed Fractional Packing and Covering Problems -- Regular Papers -- Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial k-Trees -- Online Bin Packing with Resource Augmentation -- A PTAS for Delay Minimization in Establishing Wireless Conference Calls -- This Side Up! -- Approximation Algorithm for Directed Multicuts -- Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria -- Approximation Algorithms for Spreading Points -- More Powerful and Simpler Cost-Sharing Methods -- Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints -- Priority Algorithms for Graph Optimization Problems -- Pricing Network Edges to Cross a River -- Submodular Integer Cover and Its Application to Production Planning -- Stochastic Online Scheduling on Parallel Machines -- A -Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path -- Order-Preserving Transformations and Greedy-Like Algorithms -- Off-line Admission Control for Advance Reservations in Star Networks -- Joint Base Station Scheduling -- Universal Bufferless Routing -- Strong Colorings of Hypergraphs -- Deterministic Monotone Algorithms for Scheduling on Related Machines -- Better Bounds for Minimizing SONET ADMs.
520 $aThe 2nd Workshop on Approximation and Online Algorithms (WAOA 2004) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications arising from a variety of?elds. WAOA 2004 took place in Bergen, Norway, from September 14 to September 16, 2004. The workshop was part of the ALGO 2004 event which also hosted ESA, WABI, IWPEC, and ATMOS. TopicsofinterestsforWAOA2004were:applicationstogametheory, appr- imation classes, coloring and partitioning, competitive analysis, computational?nance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, routing, packing and covering, paradigms, randomization techniques, and scheduling problems. In response to our call we received 47 submissions. Each submission was reviewed by at least 3 referees, who judged the paper on originality, quality, and consistency with the topics of the conference. Based on the reviews, the Program Committee selected 21 papers. This volume contains the 21 selected papers and the two invited talks given by Yossi Azar and Klaus Jansen. We thank all the authors who submitted papers to the workshop and we also kindly thank the local organizers of ALGO 2004.
650 0 $aOnline algorithms$vCongresses.
650 0 $aMathematical optimization$vCongresses.
650 6 $aAlgorithmes en ligne$vCongrès.
650 6 $aOptimisation mathématique$vCongrès.
650 7 $aCOMPUTERS$xProgramming$xOpen Source.$2bisacsh
650 7 $aCOMPUTERS$xSoftware Development & Engineering$xTools.$2bisacsh
650 7 $aCOMPUTERS$xSoftware Development & Engineering$xGeneral.$2bisacsh
650 7 $aInformatique.$2eclas
650 7 $aMathematical optimization.$2fast$0(OCoLC)fst01012099
650 7 $aOnline algorithms.$2fast$0(OCoLC)fst01045924
650 7 $aApproximation$2gnd
650 7 $aOnline-Algorithmus$2gnd
650 7 $aAlgorithme en ligne.$2rasuqam
650 7 $aApproximation numérique.$2rasuqam
650 7 $aOptimisation mathématique.$2rasuqam
651 7 $aBergen (Norwegen, 2004)$2swd
655 4 $aElectronic books.
655 7 $aConference papers and proceedings.$2fast$0(OCoLC)fst01423772
655 7 $aKongress.$2swd
700 1 $aPersiano, Giuseppe.
700 1 $aSolis-Oba, Roberto.
776 08 $iPrint version:$aWAOA 2004 (2004 : Bergen, Norway).$tApproximation and online algorithms.$dBerlin ; New York : Springer, ©2005$z354024574X$z9783540245742$w(DLC) 2005921102$w(OCoLC)58750354
830 0 $aLecture notes in computer science ;$v3351.$x0302-9743
856 40 $3ProQuest Ebook Central$uhttp://public.ebookcentral.proquest.com/choice/publicfullrecord.aspx?p=3067984
856 40 $3ebrary$uhttp://site.ebrary.com/id/10528970
856 40 $3EBSCOhost$uhttps://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=183032
856 40 $3MyiLibrary$uhttp://www.myilibrary.com?id=140607
856 40 $3OhioLINK$uhttp://rave.ohiolink.edu/ebooks/ebc/11389811
856 40 $3SpringerLink$uhttps://doi.org/10.1007/b106130
856 40 $3SpringerLink$uhttp://www.springerlink.com/openurl.asp?genre=book&isbn=978-3-540-24574-2
856 40 $3SpringerLink$uhttp://link.springer.com/openurl?genre=book&isbn=978-3-540-24574-2
856 40 $3SpringerLink$uhttp://link.springer.com/10.1007/b106130
856 40 $3SpringerLink$uhttps://link.springer.com/openurl?genre=book&isbn=978-3-540-24574-2
856 40 $3SpringerLink$uhttps://link.springer.com/book/10.1007/b106130
856 40 $uhttp://springerlink.metapress.com/link.asp?id=gd1pkbhtbdly$zConnect to electronic version (PDF)
856 40 $uhttps://0-link-springer-com.pugwash.lib.warwick.ac.uk/book/10.1007/b106130$zConnect to Springer e-book
856 40 $uhttp://link.springer-ny.com/link/service/series/0558/tocs/t3351.htm
856 40 $uhttps://0-link-springer-com.pugwash.lib.warwick.ac.uk/10.1007/b106130$zConnect to Springer e-book
856 41 $uhttp://springerlink.metapress.com/openurl.asp?genre=issue&issn=0302-9743&volume=3351$zRestricted to Springer LINK subscribers
938 $aProQuest Ebook Central$bEBLB$nEBL3067984
938 $aebrary$bEBRY$nebr10528970
938 $aEBSCOhost$bEBSC$n183032
938 $aOtto Harrassowitz$bHARR$nhar055005015
938 $aProQuest MyiLibrary Digital eBook Collection$bIDEB$ncis23803240
938 $aYBP Library Services$bYANK$n3023338
029 1 $aAU@$b000040684058
029 1 $aAU@$b000042061265
029 1 $aAU@$b000058157522
029 1 $aDKDLA$b820120-katalog:000462384
029 1 $aHEBIS$b192057677
029 1 $aNLGGC$b384383041
994 $aZ0$bP4A
948 $hNO HOLDINGS IN P4A - 406 OTHER HOLDINGS