Overview

Full Product Details

Author:   Stefan Näher ,  Dorothea Wagner
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   2001 ed.
Volume:   1982
Dimensions:   Width: 15.50cm , Height: 1.30cm , Length: 23.50cm
Weight:   0.800kg
ISBN:  

9783540425120

ISBN 10:   3540425128
Pages:   246
Publication Date:   15 August 2001
Audience:   College/higher education ,  Professional and scholarly ,  Postgraduate, Research & Scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print  
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

Invited Lectures.- On the Differences between Practical and Applied .- Contributed Papers.- An Experimental Study of Online Scheduling Algorithms.- Implementation of O(nmlog n) Weighted Matchings in General Graphs. The Power of Data Structures.- Pushing the Limits in Sequential Sorting.- Efficient Sorting Using Registers and Caches.- Lattice Basis Reduction with Dynamic Approximation.- Clustering Data without Prior Knowledge.- Recognizing Bundles in Time Table Graphs - A Structural Approach.- Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks.- Portable List Ranking: An Experimental Study.- Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM.- Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms.- Visualizing Algorithms Over the Web with the Publication-Driven Approach.- Interchanging Tw Segments of an Array in a Hierarchical Memory System.- Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves.- Planar Point Location for Large Data Sets: To Seek or Not to Seek.- Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees.- Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees.- Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study.- New Algorithms for Examination Timetabling.

Reviews

Author Information

Tab Content 6

Author Website:  

Countries Available

All regions