000 | 02941nam a22005535i 4500 | ||
---|---|---|---|
001 | 978-3-540-45643-8 | ||
003 | DE-He213 | ||
005 | 20160624102006.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2002 gw | s |||| 0|eng d | ||
020 |
_a9783540456438 _9978-3-540-45643-8 |
||
024 | 7 |
_a10.1007/3-540-45643-0 _2doi |
|
050 | 4 | _aQA76.9.A43 | |
072 | 7 |
_aUMB _2bicssc |
|
072 | 7 |
_aCOM051300 _2bisacsh |
|
082 | 0 | 4 |
_a005.1 _223 |
245 | 1 | 0 |
_aAlgorithm Engineering and Experiments _h[electronic resource] : _b4th International Workshop, ALENEX 2002 San Francisco, CA, USA, January 4–5, 2002 Revised Papers / _cedited by David M. Mount, Clifford Stein. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2002. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2002. |
|
300 |
_aVIII, 212 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, _x0302-9743 ; _v2409 |
|
505 | 0 | _aALENEX 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 | _aComputer science. | |
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aComputer software. | |
650 | 0 | _aElectronic data processing. | |
650 | 0 | _aComputational complexity. | |
650 | 0 | _aComputer graphics. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aData Structures. |
650 | 2 | 4 | _aComputer Graphics. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aNumeric Computing. |
700 | 1 |
_aMount, David M. _eeditor. |
|
700 | 1 |
_aStein, Clifford. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540439776 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v2409 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-45643-0 |
942 |
_2EBK5494 _cEBK |
||
999 |
_c34788 _d34788 |