Cargando…

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

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 fi...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Lerner, Jürgen (Editor ), Wagner, Dorothea (Editor ), Zweig, Katharina (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2009.
Edición:1st ed. 2009.
Colección:Theoretical Computer Science and General Issues, 5515
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-642-02094-0
003 DE-He213
005 20230406052616.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 |a 9783642020940  |9 978-3-642-02094-0 
024 7 |a 10.1007/978-3-642-02094-0  |2 doi 
050 4 |a QA76.6-76.66 
072 7 |a UM  |2 bicssc 
072 7 |a COM051000  |2 bisacsh 
072 7 |a UM  |2 thema 
082 0 4 |a 005.11  |2 23 
245 1 0 |a Algorithmics of Large and Complex Networks  |h [electronic resource] :  |b Design, Analysis, and Simulation /  |c edited by Jürgen Lerner, Dorothea Wagner, Katharina Zweig. 
250 |a 1st ed. 2009. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2009. 
300 |a X, 401 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 5515 
505 0 |a Network Algorithms -- Design and Engineering of External Memory Traversal Algorithms for General Graphs -- Minimum Cycle Bases and Their Applications -- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability -- Iterative Compression for Exactly Solving NP-Hard Minimization Problems -- Approaches to the Steiner Problem in Networks -- A Survey on Multiple Objective Minimum Spanning Tree Problems -- Traffic Networks -- Engineering Route Planning Algorithms -- From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future -- Traffic Networks and Flows over Time -- Communication Networks -- Interactive Communication, Diagnosis and Error Control in Networks -- Resource Management in Large Networks -- Multicast Routing and Design of Sparse Connectors -- Management of Variable Data Streams in Networks -- Models of Non-atomic Congestion Games - From Unicast to Multicast Routing -- New Data Structures for IP Lookup and Conflict Detection -- Network Analysis and Simulation -- Group-Level Analysis and Visualization of Social Networks -- Modeling and Designing Real-World Networks -- Algorithms and Simulation Methods for Topology-Aware Sensor Networks. 
520 |a 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. 
650 0 |a Computer programming. 
650 0 |a Computer networks . 
650 0 |a Computer science. 
650 0 |a Algorithms. 
650 0 |a Computer science-Mathematics. 
650 0 |a Discrete mathematics. 
650 0 |a Numerical analysis. 
650 1 4 |a Programming Techniques. 
650 2 4 |a Computer Communication Networks. 
650 2 4 |a Theory of Computation. 
650 2 4 |a Algorithms. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Numerical Analysis. 
700 1 |a Lerner, Jürgen.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Wagner, Dorothea.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Zweig, Katharina.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783642020957 
776 0 8 |i Printed edition:  |z 9783642020933 
830 0 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 5515 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-642-02094-0  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)