|
|
|
|
| LEADER |
03597nam a2200589 4500 |
| 001 |
978-3-540-45643-8 |
| 003 |
DE-He213 |
| 005 |
20191028111413.0 |
| 007 |
cr nn 008mamaa |
| 008 |
121227s2002 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540456438
|9 978-3-540-45643-8
|
| 024 |
7 |
|
|a 10.1007/3-540-45643-0
|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 Experiments
|h [electronic resource] :
|b 4th International Workshop, ALENEX 2002, San Francicsco, CA, USA, January 4-5, 2002, Revised Papers /
|c edited by David M. Mount, Clifford Stein.
|
| 250 |
|
|
|a 1st ed. 2002.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2002.
|
| 300 |
|
|
|a VIII, 212 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 2409
|
| 505 |
0 |
|
|a ALENEX 2002 -- On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs -- A Time-Sensitive System for Black-Box Combinatorial Optimization -- A Compressed Breadth-First Search for Satisfiability -- Using Multi-level Graphs for Timetable Information in Railway Systems -- Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation -- An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web -- The Treewidth of Java Programs -- Partitioning Planar Graphs with Costs and Weights -- Maintaining Dynamic Minimum Spanning Trees: An Experimental Study -- Experimental Evaluation of a New Shortest Path Algorithm -- Getting More from Out-of-Core Columnsort -- Topological Sweep in Degenerate Cases -- Acceleration of K-Means and Related Clustering Algorithms -- STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects -- An Improvement on Tree Selection Sort.
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Data structures (Computer science).
|
| 650 |
|
0 |
|a Computer graphics.
|
| 650 |
|
0 |
|a Computer science-Mathematics.
|
| 650 |
1 |
4 |
|a Programming Techniques.
|0 http://scigraph.springernature.com/things/product-market-codes/I14010
|
| 650 |
2 |
4 |
|a Software Engineering/Programming and Operating Systems.
|0 http://scigraph.springernature.com/things/product-market-codes/I14002
|
| 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 Discrete Mathematics in Computer Science.
|0 http://scigraph.springernature.com/things/product-market-codes/I17028
|
| 700 |
1 |
|
|a Mount, David M.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Stein, Clifford.
|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 9783662181553
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540439776
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2409
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-45643-0
|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)
|
