Algorithms and Computation

Algorithms and Computation: 12th International Symposium, ISAAC 2001 Christchurch, New Zealand, December 19–21, 2001 ProceedingsAuthor: Peter Eades, Tadao Takaoka Published by Springer Berlin Heidelberg ISBN: 978-3-540-42985-2 DOI: 10.1007/3-540-45678-3Table of Contents:Chain Reconfiguration The Ins and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages
Application of M-Convex Submodular Flow Problem to Mathematical Economics
A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling
A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times
Semi-normal Schedulings: Improvement on Goemans’ Algorithm
Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness
Broadcasting with Universal Lists Revisited: Using Competitive Analysis
On Adaptive Fault Diagnosis for Multiprocessor Systems
On-Line Multicasting in All-Optical Networks
Enumerating Floorplans with n Rooms
On Min-Max Cycle Bases
On the Minimum Local-Vertex-Connectivity Augmentation in Graphs
Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique Number
Quantum Algorithms for Intersection and Proximity Problems
BUSHWHACK: An Approximation Algorithm for Minimal Paths through Pseudo-Euclidean Spaces
Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees
Tree-Approximations for the Weighted Cost-Distance Problem
Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups
Generic Algorithms and Key Agreement Protocols Based on Group Actions
Baire Category and Nowhere Differentiability for Feasible Real Functions