000 05441nam a22006375i 4500
001 978-3-540-44691-0
003 DE-He213
005 20240423132502.0
007 cr nn 008mamaa
008 121227s2001 gw | s |||| 0|eng d
020 _a9783540446910
_9978-3-540-44691-0
024 7 _a10.1007/3-540-44691-5
_2doi
050 4 _aQA76.6-76.66
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aUM
_2thema
082 0 4 _a005.11
_223
245 1 0 _aAlgorithm Engineering
_h[electronic resource] :
_b4th International Workshop, WAE 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings /
_cedited by Stefan Näher, Dorothea Wagner.
250 _a1st ed. 2001.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2001.
300 _aVIII, 246 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1982
505 0 _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.
520 _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.
650 0 _aComputer programming.
650 0 _aComputer science.
650 0 _aAlgorithms.
650 0 _aNumerical analysis.
650 0 _aArtificial intelligence
_xData processing.
650 0 _aComputer networks .
650 1 4 _aProgramming Techniques.
650 2 4 _aTheory of Computation.
650 2 4 _aAlgorithms.
650 2 4 _aNumerical Analysis.
650 2 4 _aData Science.
650 2 4 _aComputer Communication Networks.
700 1 _aNäher, Stefan.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aWagner, Dorothea.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540425120
776 0 8 _iPrinted edition:
_z9783662193013
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1982
856 4 0 _uhttps://doi.org/10.1007/3-540-44691-5
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188272
_d188272