点此进入淘宝搜索页搜索　　參考價格: 点此进入淘宝搜索页搜索
　　分類: 图书,进口原版书,计算机 Computers & Internet ,

作者： Stefan Näher等编

出 版 社： Oversea Publishing House

出版时间： 2001-9-1字数：版次： 1页数： 241印刷时间： 2001/09/01开本： 16开印次： 1纸张： 胶版纸I S B N ： 9783540425120包装： 平装内容简介

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

 

 

免责声明：本文为网络用户发布，其观点仅代表作者个人观点，与本站无关，本站仅提供信息存储服务。文中陈述内容未经本站证实，其真实性、完整性、及时性本站不作任何保证或承诺，请读者仅作参考，并请自行核实相关内容。