LEADER 04436nam  22006975  450 
001 9910767579403321
005 20200630000819.0
010   $a3-540-68311-9
024 7 $a10.1007/BFb0029561
035   $a(CKB)1000000000234827
035   $a(SSID)ssj0000325378
035   $a(PQKBManifestationID)11912721
035   $a(PQKBTitleCode)TC0000325378
035   $a(PQKBWorkID)10321711
035   $a(PQKB)10211996
035   $a(DE-He213)978-3-540-68311-7
035   $a(PPN)155182811
035   $a(EXLCZ)991000000000234827
100   $a20121227d1998      u|         0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aOnline Algorithms$b[electronic resource] $eThe State of the Art /$fedited by Amos Fiat, Gerhard J. Woeginger
205   $a1st ed. 1998.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1998.
215   $a1 online resource (XVIII, 436 p. 1 illus.)
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1442
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-64917-4 
327   $aCompetitive analysis of algorithms -- Self-organizing data structures -- Competitive analysis of paging -- Metrical task systems, the server problem and the work function algorithm -- Distributed paging -- Competitive analysis of distributed algorithms -- On-line packing and covering problems -- On-line load balancing -- On-line scheduling -- On-line searching and navigation -- On-line network routing -- On-line network optimization problems -- Coloring graphs on-line -- On-Line Algorithms in Machine Learning -- Competitive solutions for on-line financial problems -- On the performance of competitive algorithms in practice -- Competitive odds and ends.
330   $aThis coherent anthology presents the state of the art in the booming area of online algorithms and competitive analysis of such algorithms. The 17 papers are carefully revised and thoroughly improved versions of presentations given first during a Dagstuhl seminar in 1996. An overview by the volume editors introduces the area to the reader. The technical chapters are devoted to foundational and methodological issues for the design and analysis of various classes of online algorithms as well as to the detailed evaluation of algorithms for various activities in online processing, ranging from load balancing and scheduling to networking and financial problems. An outlook by the volume editors and a bibliography listing more than 750 references complete the work. The book is ideally suited for advanced courses and self-study in online algorithms. It is indispensable reading for researchers and professionals active in the area.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v1442
606   $aComputer networks
606   $aAlgorithms
606   $aComputer programming
606   $aComputer science?Mathematics
606   $aCalculus of variations
606   $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022
606   $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021
606   $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010
606   $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028
606   $aCalculus of Variations and Optimal Control; Optimization$3https://scigraph.springernature.com/ontologies/product-market-codes/M26016
615  0$aComputer networks.
615  0$aAlgorithms.
615  0$aComputer programming.
615  0$aComputer science?Mathematics.
615  0$aCalculus of variations.
615 14$aComputer Communication Networks.
615 24$aAlgorithm Analysis and Problem Complexity.
615 24$aProgramming Techniques.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aCalculus of Variations and Optimal Control; Optimization.
676   $a005.1
702   $aFiat$b Amos$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aWoeginger$b Gerhard J$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a9910767579403321
996   $aOnline algorithms$91489276
997   $aUNINA