工程算法（第4届国际专题会议）Algorithm Engineering pdf pdb 阿里云 极速 mobi caj kindle 下载

This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Algorithm Engineering, WAE 2000, held in Saarbrücken, Germany in September 2000. The 19 revised full papers presented together with one invited paper were carefully reviewed and selected from a total of 30 submissions. Among the topics addressed are software repositories allowing for the use and experimentation with efficient discrete algorithms; novel uses of discrete algorithms; methodological issues on algorithms and data structures; and methodological issues on converting user requirements into efficient algorithmic and implementation solutions.

Invited Lectures

　On the Differences between "Practical" and "Applied".

Karsten Weihe

Contributed Papers

　An Experimental Study of Online Scheduling Algorithms

Susanne Albers and Bianca SchrSder

　Implementation of O(nm log n) Weighted Matchings in General Graphs. The Power of Data Structures

　　Kurt Mehlhorn and Guido Schiller

　Pushing the Limits in Sequential Sorting

　　Stefan Edelkamp and Patrick Stiegeler

　Efficient Sorting Using Registers and Caches

　　Lars Arge, Jeff Chase, Jeffrey S. Vitter, and Rajiv Wickremesinghe

　Lattice Basis Reduction with Dynamic Approximation

　　Werner Backes and Susanne Wetzel

　Clustering Data without Prior Knowledge

　　Javed Aslam, Alain Leblanc, and Clifford Stein

　Recognizing Bundles in Time Table Graphs - A Structural Approach

　　Annegret Liebers and Karsten Weihe

　Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks

　　I. Chatzigiannakis, S. Nikoletseas, and P. Spirakis

　Portable List Ranking: An Experimental Study

　　Isabelle Guerin Lassous and Jens Gustedt

　Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM

　　Kazuo Iwarna, Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe,and Jun Umemoto

　Asymptotic Complexity from Experiments?A Case Study for Randomized Algorithms

　　Peter Sanders and Rudolf Fleischer

　Visualizing Algorithms over the Web with the Publication-Driven Approach

　　Camil Demetrescu, Irene Finocchi, and Giuseppe Liotta

　Interchanging Two Segments of an Array in a Hierarchical Memory System

　　Jesper Bojesen and Jyrki Katajainen

Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves

　　Iddo Hanniel and Dan Halperin

Planar Point Location for Large Data Sets: To Seek or Not to Seek

　　Jan Vahrenhold and Klaus H. Hinrichs

Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees

　　Thomas Erlebach and Klaus Jansen

Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees

　　Guido Proietti

Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights:An Experimental Study

　　Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela,and Umberto Nanni

New Algorithms for Examination Timetabling

　　Massimiliano Caramia, Paolo Dell'Olmo, and Giuseppe F. Italiano

Author Index

暂无相关内容，正在全力查找中

暂无出版社相关信息，正在全力查找中！

暂无相关书籍摘录，正在全力查找中！

在线阅读地址：工程算法（第4届国际专题会议）Algorithm Engineering在线阅读

在线听书地址：工程算法（第4届国际专题会议）Algorithm Engineering在线收听

在线购买地址：工程算法（第4届国际专题会议）Algorithm Engineering在线购买

暂无原文赏析，正在全力查找中！

书籍介绍

在线阅读本书

This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Algorithm Engineering, WAE 2000, held in Saarbrücken, Germany in September 2000. The 19 revised full papers presented together with one invited paper were carefully reviewed and selected from a total of 30 submissions. Among the topics addressed are software repositories allowing for the use and experimentation with efficient discrete algorithms; novel uses of discrete algorithms; methodological issues on algorithms and data structures; and methodological issues on converting user requirements into efficient algorithmic and implementation solutions.