|
|
|
|
LEADER |
03864nam a2200589 4500 |
001 |
978-3-540-44808-2 |
003 |
DE-He213 |
005 |
20191220125850.0 |
007 |
cr nn 008mamaa |
008 |
121227s2001 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540448082
|9 978-3-540-44808-2
|
024 |
7 |
|
|a 10.1007/3-540-44808-X
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA76.6-76.66
|
072 |
|
7 |
|a UM
|2 bicssc
|
072 |
|
7 |
|a COM051000
|2 bisacsh
|
072 |
|
7 |
|a UM
|2 thema
|
082 |
0 |
4 |
|a 005.11
|2 23
|
245 |
1 |
0 |
|a Algorithm Engineering and Experimentation
|h [electronic resource] :
|b Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers /
|c edited by Adam L. Buchsbaum, Jack Snoeyink.
|
250 |
|
|
|a 1st ed. 2001.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2001.
|
300 |
|
|
|a VIII, 236 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2153
|
505 |
0 |
|
|a 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.
|
650 |
|
0 |
|a Computer programming.
|
650 |
|
0 |
|a Database management.
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Data structures (Computer science).
|
650 |
|
0 |
|a Computer graphics.
|
650 |
|
0 |
|a Numerical analysis.
|
650 |
1 |
4 |
|a Programming Techniques.
|0 http://scigraph.springernature.com/things/product-market-codes/I14010
|
650 |
2 |
4 |
|a Database Management.
|0 http://scigraph.springernature.com/things/product-market-codes/I18024
|
650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|0 http://scigraph.springernature.com/things/product-market-codes/I16021
|
650 |
2 |
4 |
|a Data Structures.
|0 http://scigraph.springernature.com/things/product-market-codes/I15017
|
650 |
2 |
4 |
|a Computer Graphics.
|0 http://scigraph.springernature.com/things/product-market-codes/I22013
|
650 |
2 |
4 |
|a Numeric Computing.
|0 http://scigraph.springernature.com/things/product-market-codes/I1701X
|
700 |
1 |
|
|a Buchsbaum, Adam L.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
700 |
1 |
|
|a Snoeyink, Jack.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783662208526
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540425601
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2153
|
856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-44808-X
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
912 |
|
|
|a ZDB-2-BAE
|
950 |
|
|
|a Computer Science (Springer-11645)
|