05136nam 22008295 450 991076757580332120251116234211.03-540-44808-X10.1007/3-540-44808-X(CKB)1000000000211632(SSID)ssj0000321162(PQKBManifestationID)11262212(PQKBTitleCode)TC0000321162(PQKBWorkID)10262691(PQKB)10218497(DE-He213)978-3-540-44808-2(MiAaPQ)EBC3072006(PPN)155173057(BIP)13627201(BIP)7351664(EXLCZ)99100000000021163220121227d2001 u| 0engurnn|008mamaatxtccrAlgorithm Engineering and Experimentation Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers /edited by Adam L. Buchsbaum, Jack Snoeyink1st ed. 2001.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2001.1 online resource (VIII, 236 p.) Lecture Notes in Computer Science,0302-9743 ;2153Bibliographic Level Mode of Issuance: Monograph3-540-42560-8 Includes bibliographical references and index.ALENEX’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.This book constitutes the thoroughly refereed post-proceedings of the Third International Workshop on Algorithm Engineering and Experimentation, ALENEX 2001, held in Washington, DC, USA in January 2001.The 15 revised full papers presented together with the abstracts of three invited presentations have gone through two rounds of reviewing and revision and were selected from 31 submissions. Among the topics addressed are heuristics for approximation, network optimization, TSP, randomization, sorting, information retrieval, graph computations, tree clustering, scheduling, network algorithms, point set computations, searching, and data mining.Lecture Notes in Computer Science,0302-9743 ;2153Computer programmingDatabase managementAlgorithmsData structures (Computer science)Computer graphicsNumerical analysisProgramming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Database Managementhttps://scigraph.springernature.com/ontologies/product-market-codes/I18024Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Data Structureshttps://scigraph.springernature.com/ontologies/product-market-codes/I15017Computer Graphicshttps://scigraph.springernature.com/ontologies/product-market-codes/I22013Numeric Computinghttps://scigraph.springernature.com/ontologies/product-market-codes/I1701XComputer programming.Database management.Algorithms.Data structures (Computer science)Computer graphics.Numerical analysis.Programming Techniques.Database Management.Algorithm Analysis and Problem Complexity.Data Structures.Computer Graphics.Numeric Computing.005.1Buchsbaum Adam Ledthttp://id.loc.gov/vocabulary/relators/edtSnoeyink Jackedthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK9910767575803321Algorithm Engineering and Experimentation2165839UNINA