Share on TelegramAlgorithms and computation : 12th international symposium, Christchurch, New Zealand, December 19 21, 2001 ;
User Rating: Be the first one!
Author: Eades, Peter Hrsg. edt, ISAAC 12 2001 Christchurch, New Zealand (DE-601)336792263 (DE-588)10030365-1, Annual International Symposium on Algorithms and Computation (12 2001.12.19-21 Christchurch), ISAAC 2001 (12 2001.12.19-21 Christchurch)
Added by: sketch
Added Date: 2015-12-30
Language: eng
Publishers: Berlin [u.a.] Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 3540429859, 9783540429852
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 402.47 MB
PDF Size: 42.89 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Edition: [Elektronische Ressource]
Downloads: 294
Views: 344
Total Files: 18
Media Type: texts
Total Files: 5
TORRENT
springer 10 1007 3 540 45678 3 archive t...torrent
Last Modified: 2022-03-09 09:05:41
Download
Size: 19.83 KB
Description
Algorithms and Computation: 12th International Symposium, ISAAC 2001 Christchurch, New Zealand, December 19–21, 2001 Proceedings
Author: Peter Eades, Tadao Takaoka
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42985-2
DOI: 10.1007/3-540-45678-3
Table of Contents:
Author: Peter Eades, Tadao Takaoka
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42985-2
DOI: 10.1007/3-540-45678-3
Table 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
You May Also Like
We will be happy to hear your thoughts
