LEADER 04414nam  22007935  450 
001 9910767575803321
005 20200703044241.0
010   $a3-540-44808-X
024 7 $a10.1007/3-540-44808-X
035   $a(CKB)1000000000211632
035   $a(SSID)ssj0000321162
035   $a(PQKBManifestationID)11262212
035   $a(PQKBTitleCode)TC0000321162
035   $a(PQKBWorkID)10262691
035   $a(PQKB)10218497
035   $a(DE-He213)978-3-540-44808-2
035   $a(MiAaPQ)EBC3072006
035   $a(PPN)155173057
035   $a(EXLCZ)991000000000211632
100   $a20121227d2001      u|         0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aAlgorithm Engineering and Experimentation $eThird International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers /$fedited by Adam L. Buchsbaum, Jack Snoeyink
205   $a1st ed. 2001.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2001.
215   $a1 online resource (VIII, 236 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2153
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-42560-8 
320   $aIncludes bibliographical references and index.
327   $aALENEX?01 -- Solving a ?Hard? Problem to Approximate an ?Easy? One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems -- CNOP - A Package for Constrained Network Optimization -- The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests -- Network Tomography through End-to-End Measurements -- Experimental Results on Statistical Approaches to Page Replacement Policies -- Estimating Resemblance of MIDI Documents -- Experiments on Adaptive Set Intersections for Text Retrieval Systems -- PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets -- Hierarchical Clustering of Trees: Algorithms and Experiments -- Travel Planning with Self-Made Maps -- New Algorithmic Challenges Arising in Measurement-Driven Networking Research -- A Probabilistic Spell for the Curse of Dimensionality -- Experimental Evaluation of the Height of a Random Set of Points in a d-Dimensional Cube -- An Empirical Study of a New Approach to Nearest Neighbor Searching -- Spectral Analysis for Data Mining -- Trade Off Between Compression and Search Times in Compact Suffix Array -- Implementation of a PTAS for Scheduling with Release Dates -- Biased Skip Lists for Highly Skewed Access Patterns.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v2153
606   $aComputer programming
606   $aDatabase management
606   $aAlgorithms
606   $aData structures (Computer science)
606   $aComputer graphics
606   $aNumerical analysis
606   $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010
606   $aDatabase Management$3https://scigraph.springernature.com/ontologies/product-market-codes/I18024
606   $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021
606   $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017
606   $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013
606   $aNumeric Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I1701X
615  0$aComputer programming.
615  0$aDatabase management.
615  0$aAlgorithms.
615  0$aData structures (Computer science).
615  0$aComputer graphics.
615  0$aNumerical analysis.
615 14$aProgramming Techniques.
615 24$aDatabase Management.
615 24$aAlgorithm Analysis and Problem Complexity.
615 24$aData Structures.
615 24$aComputer Graphics.
615 24$aNumeric Computing.
676   $a005.1
702   $aBuchsbaum$b Adam L$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aSnoeyink$b Jack$4edt$4http://id.loc.gov/vocabulary/relators/edt
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910767575803321
996   $aAlgorithm Engineering and Experimentation$92165839
997   $aUNINA