|
|
|
|
| LEADER |
02876nam a22004935i 4500 |
| 001 |
978-3-540-26908-3 |
| 003 |
DE-He213 |
| 005 |
20151204182443.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2005 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540269083
|9 978-3-540-26908-3
|
| 024 |
7 |
|
|a 10.1007/b138283
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA164-167.2
|
| 072 |
|
7 |
|a PBV
|2 bicssc
|
| 072 |
|
7 |
|a MAT036000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 511.6
|2 23
|
| 100 |
1 |
|
|a Jungnickel, Dieter.
|e author.
|
| 245 |
1 |
0 |
|a Graphs, Networks and Algorithms
|h [electronic resource] /
|c by Dieter Jungnickel.
|
| 250 |
|
|
|a Second Edition.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2005.
|
| 300 |
|
|
|a XVI, 612 p. 195 illus.
|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 Algorithms and Computation in Mathematics,
|x 1431-1550 ;
|v 5
|
| 505 |
0 |
|
|a Basic Graph Theory -- Algorithms and Complexity -- Shortest Paths -- Spanning Trees -- The Greedy Algorithm -- Flows -- Combinatorial Applications -- Connectivity and Depth First Search -- Colorings -- Circulations -- The Network Simplex Algorithm -- Synthesis of Networks -- Matchings -- Weighted matchings -- A Hard Problem: The TSP.
|
| 520 |
|
|
|a From the reviews of the first edition: ".... The book is a first class textbook and seems to be indispensable for everybody who has to teach combinatorial optimization. It is very helpful for students, teachers, and researchers in this area. The author finds a striking synthesis of nice and interesting mathematical results and practical applications. ... the author pays much attention to the inclusion of well-chosen exercises. The reader does not remain helpless; solutions or at least hints are given in the appendix. Except for some small basic mathematical and algorithmic knowledge the book is self-contained. ..." Mathematical Reviews 2002 This thoroughly revised new edition offers a new chapter on the network simplex algorithm and a section on the five color theorem. Moreover, numerous smaller changes and corrections have been made and several recent developments have been discussed and referenced.
|
| 650 |
|
0 |
|a Mathematics.
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
|
0 |
|a Mathematical optimization.
|
| 650 |
|
0 |
|a Combinatorics.
|
| 650 |
1 |
4 |
|a Mathematics.
|
| 650 |
2 |
4 |
|a Combinatorics.
|
| 650 |
2 |
4 |
|a Optimization.
|
| 650 |
2 |
4 |
|a Mathematics of Computing.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540219057
|
| 830 |
|
0 |
|a Algorithms and Computation in Mathematics,
|x 1431-1550 ;
|v 5
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/b138283
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SMA
|
| 950 |
|
|
|a Mathematics and Statistics (Springer-11649)
|
