Algorithm Engineering and Experimentation: International Workshop ALENEX'99 Baltimore, MD, USA, January 15-16, 1999, Selected Papers

ISBN-13: 9783540662273 / Angielski / Miękka / 1999 / 356 str.

Michael T. Goodrich;Catherine C. McGeoch

Opis

This volume constitutes the refereed post-workshop proceedings of the International Workshop on Algorithmic Engineering and Experimentation (ALENEX'99), held in Baltimore, Maryland, USA, in January 1999. The 20 revised full papers presented were carefully selected from a total of 42 submissions during two rounds of reviewing and improvement. The papers are organized into sections on combinatorial algorithms, computational geometry, software and applications, algorithms for NP-hard problems and data structures.

Spis treści

Combinatorial Algorithms.- Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes.- Implementing Weighted b-Matching Algorithms: Insights from a Computational Study.- Designing Practical Efficient Algorithms for Symmetric Multiprocessors.- Circular Drawings of Biconnected Graphs.- Heuristics and Experimental Design for Bigraph Crossing Number Minimization.- Binary Space Parititions in Plücker Space.- Practical Point-in-Polygon Tests Using CSG Representations of Polygons.- Software and Applications.- Accessing the Internal Organization of Data Structures in the JDSL Library.- Object-Oriented Design of Graph Oriented Data Structures.- A Case Study on the Cost of Geometric Computing.- Design and Implementation of the Fiduccia-Mattheyses Heuristic for VLSI Netlist Partitioning.- Algorithms for Restoration Planning in a Telecommunications Network.- Computing the n × m Shortest Paths Efficiently.- Image Watermarking for Copyright Protection.- Algorithms for NP-Hard Problems.- A Self Organizing Bin Packing Heuristic.- Finding the Right Cutting Planes for the TSP.- Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm.- Data Structures.- Adaptive Algorithms for Cache-efficient Trie Search.- Fast Priority Queues for Cached Memory.- Efficient Bulk Operations on Dynamic R-trees.