Algorithmics of Large and Complex Networks: Design, Analysis, and Simulation

Deepak Ajwani, Ulrich Meyer (auth.), Jürgen Lerner, Dorothea Wagner, Katharina A. Zweig (eds.)3642020933, 9783642020933

Networks play a central role in today’s society, since many sectors employing information technology, such as communication, mobility, and transport – even social interactions and political activities – are based on and rely on networks. In these times of globalization and the current global financial crisis with its complex and nearly incomprehensible entanglements of various structures and its huge effect on seemingly unrelated institutions and organizations, the need to understand large networks, their complex structures, and the processes governing them is becoming more and more important.

This state-of-the-art survey reports on the progress made in selected areas of this important and growing field, thus helping to analyze existing large and complex networks and to design new and more efficient algorithms for solving various problems on these networks since many of them have become so large and complex that classical algorithms are not sufficient anymore. This volume emerged from a research program funded by the German Research Foundation (DFG) consisting of projects focusing on the design of new discrete algorithms for large and complex networks. The 18 papers included in the volume present the results of projects realized within the program and survey related work. They have been grouped into four parts: network algorithms, traffic networks, communication networks, and network analysis and simulation.

Table of contents :
Front Matter….Pages –
Design and Engineering of External Memory Traversal Algorithms for General Graphs….Pages 1-33
Minimum Cycle Bases and Their Applications….Pages 34-49
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability….Pages 50-64
Iterative Compression for Exactly Solving NP-Hard Minimization Problems….Pages 65-80
Approaches to the Steiner Problem in Networks….Pages 81-103
A Survey on Multiple Objective Minimum Spanning Tree Problems….Pages 104-116
Engineering Route Planning Algorithms….Pages 117-139
From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future….Pages 140-165
Traffic Networks and Flows over Time….Pages 166-196
Interactive Communication, Diagnosis and Error Control in Networks….Pages 197-226
Resource Management in Large Networks….Pages 227-246
Multicast Routing and Design of Sparse Connectors….Pages 247-265
Management of Variable Data Streams in Networks….Pages 266-291
Models of Non-atomic Congestion Games – From Unicast to Multicast Routing….Pages 292-318
New Data Structures for IP Lookup and Conflict Detection….Pages 319-329
Group-Level Analysis and Visualization of Social Networks….Pages 330-358
Modeling and Designing Real–World Networks….Pages 359-379
Algorithms and Simulation Methods for Topology-Aware Sensor Networks….Pages 380-400
Back Matter….Pages –