算法工程与实验／会议录 Algorithm engineering and experiments
点此进入淘宝搜索页搜索分類: 图书,计算机/网络,计算机理论,
作者： David M. Mount著
出 版 社： 湖南文艺出版社
出版时间： 2002-12-1字数：版次： 1页数： 204印刷时间： 2002/12/01开本：印次：纸张： 胶版纸I S B N ： 9783540439776包装： 平装编辑推荐
The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community, with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science resarch forum available.
The scope of LNCS, including its subseries LNAI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material publised traditionally includes.
-proceedings(published in time for the respective conference)
-post-proceedings(consisting of thoroughly revised final full papers)
-research monographs(which may be basde on outstanding PhD work, research projects, technical reports, etc.)
内容简介
This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Algorithm Engineering and Experiments, ALENEX 2002, held in San Francisico, CA, USA in January 2002.The 15 revised full papers presented were carefully reviewed and selected from 34 submissions. Among the topics addressed are hewistics for algorithms, combinatorial optimization, searching, graph computation, network optimization, scheduling, computational geometry, sorting, and clustering algorithms.
目录
ALENEX 2002
On the Implementation of MST-Based Heuristics for the Steiner Problemin Graphs
A Time-Sensitive System for Black-Box Combinatorial Optimization
A Compressed Breadth-First Search for Satisfiabilitv
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 theWorld Wide Web
The Treewidth of Java Programs
Partitioning Planar Graphs with Costs and Weights
Maintaining Dynamic Minimum Spanning Trees: An Exoerimental Study
Experimental Evaluation of a New Shortest Path Algorithm
Getting More from Out-of-Core Columnsort
VIII Table of Contents
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
Author Index
