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