LEADER 05901nam 22008655 450 001 9910143606803321 005 20250724091846.0 010 $a1-280-93816-1 010 $a9786610938162 010 $a3-540-44691-5 024 7 $a10.1007/3-540-44691-5 035 $a(CKB)1000000000211387 035 $a(EBL)3037329 035 $a(SSID)ssj0000288521 035 $a(PQKBManifestationID)11242700 035 $a(PQKBTitleCode)TC0000288521 035 $a(PQKBWorkID)10381494 035 $a(PQKB)11196154 035 $a(DE-He213)978-3-540-44691-0 035 $a(MiAaPQ)EBC3037329 035 $a(MiAaPQ)EBC6414108 035 $a(PPN)155165887 035 $a(EXLCZ)991000000000211387 100 $a20121227d2001 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithm Engineering $e4th International Workshop, WAE 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings /$fedited by Stefan Näher, Dorothea Wagner 205 $a1st ed. 2001. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2001. 215 $a1 online resource (250 p.) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v1982 300 $aDescription based upon print version of record. 311 08$a3-540-42512-8 320 $aIncludes bibliographical references and index. 327 $aInvited Lectures -- On the Differences between ?Practical? and ?Applied? -- Contributed Papers -- An Experimental Study of Online Scheduling Algorithms -- Implementation of O(nmlog n) Weighted Matchings in General Graphs. The Power of Data Structures -- Pushing the Limits in Sequential Sorting -- Efficient Sorting Using Registers and Caches -- Lattice Basis Reduction with Dynamic Approximation -- Clustering Data without Prior Knowledge -- Recognizing Bundles in Time Table Graphs - A Structural Approach -- Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks -- Portable List Ranking: An Experimental Study -- Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM -- Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms -- Visualizing Algorithms Over the Web with the Publication-Driven Approach -- Interchanging Tw Segments of an Array in a Hierarchical Memory System -- Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves -- Planar Point Location for Large Data Sets: To Seek or Not to Seek -- Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees -- Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees -- Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study -- New Algorithms for Examination Timetabling. 330 $aThis volume contains the papers accepted for the 4th Workshop on Algorithm Engineering (WAE 2000) held in Saarbruc ¨ ken, Germany, during 5?8 September 2000, together with the abstract of the invited lecture given by Karsten Weihe. The Workshop on Algorithm Engineering covers research on all aspects of the subject. The goal is to present recent research results and to identify and explore directions for future research. Previous meetings were held in Venice (1997), Saarbruc ¨ ken (1998), and London (1999). Papers were solicited describing original research in all aspects of algorithm engineering, including: ? Development of software repositories and platforms which allow the use of and experimentation with e?cient discrete algorithms. ? Novel uses of discrete algorithms in other disciplines and the evaluation of algorithms for realistic environments. ? Methodological issues including standards in the context of empirical - search on algorithms and data structures. ? Methodological issues regarding the process of converting user requirements into e?cient algorithmic solutions and implementations. The program committee accepted 16 from a total of 30 submissions. The program committee meeting was conducted electronically. The criteria for sel- tion were originality, quality, and relevance to the subject area of the workshop. Considerable e?ort was devoted to the evaluation of the submissions and to p- viding the authors with feedback. Each submission was reviewed by at least four program committee members (assisted by subreferees). A special issue of the ACM Journal of Experimental Algorithmics will be devoted to selected papers from WAE 2000. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v1982 606 $aComputer programming 606 $aComputer science 606 $aAlgorithms 606 $aNumerical analysis 606 $aArtificial intelligence$xData processing 606 $aComputer networks 606 $aProgramming Techniques 606 $aTheory of Computation 606 $aAlgorithms 606 $aNumerical Analysis 606 $aData Science 606 $aComputer Communication Networks 615 0$aComputer programming. 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aNumerical analysis. 615 0$aArtificial intelligence$xData processing. 615 0$aComputer networks. 615 14$aProgramming Techniques. 615 24$aTheory of Computation. 615 24$aAlgorithms. 615 24$aNumerical Analysis. 615 24$aData Science. 615 24$aComputer Communication Networks. 676 $a005.1 702 $aNa?her$b Stefan 702 $aWagner$b Dorothea$f1957- 712 12$aInternational Workshop on Algorithm Engineering. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910143606803321 996 $aAlgorithm engineering$91980326 997 $aUNINA