Algorithmics of Large and Complex Networks 2009
Jürgen Lerner, Dorothea Wagner, Katharina Anna Zweig (Eds.):
Algorithmics of Large and Complex Networks - Design, Analysis, and Simulation [DFG priority program 1126].
Lecture Notes in Computer Science 5515 Springer 2009, ISBN 978-3-642-02093-3
Network Algorithms
- Deepak Ajwani, Ulrich Meyer:
Design and Engineering of External Memory Traversal Algorithms for General Graphs.
1-33
- Franziska Berger, Peter Gritzmann, Sven de Vries:
Minimum Cycle Bases and Their Applications.
34-49
- Florian Diedrich, Klaus Jansen, Ulrich M. Schwarz, Denis Trystram:
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability.
50-64
- Jiong Guo, Hannes Moser, Rolf Niedermeier:
Iterative Compression for Exactly Solving NP-Hard Minimization Problems.
65-80
- Tobias Polzin, Siavash Vahdati Daneshmand:
Approaches to the Steiner Problem in Networks.
81-103
- Stefan Ruzika, Horst W. Hamacher:
A Survey on Multiple Objective Minimum Spanning Tree Problems.
104-116
Traffic Networks
Communication Networks
Network Analysis and Simulation
Last update Thu May 24 04:16:20 2012
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page