| 000 -LEADER |
|---|
| fixed length control field |
03903nam a22004575i 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
OSt |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20140310151458.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION |
|---|
| fixed length control field |
cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
121116s2013 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9783642322785 |
|
978-3-642-32278-5 |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA164-167.2 |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
511.6 |
| Edition number |
23 |
| 264 #1 - |
|---|
| -- |
Berlin, Heidelberg : |
| -- |
Springer Berlin Heidelberg : |
| -- |
Imprint: Springer, |
| -- |
2013. |
| 912 ## - |
|---|
| -- |
ZDB-2-SMA |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Jungnickel, Dieter. |
| Relator term |
author. |
| 245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE |
|---|
| Title |
Graphs, Networks and Algorithms |
| Medium |
[electronic resource] / |
| Statement of responsibility, etc |
by Dieter Jungnickel. |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
4th ed. 2013. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
XX, 675 p. 211 illus. |
| Other physical details |
online resource. |
| 440 1# - SERIES STATEMENT/ADDED ENTRY--TITLE |
|---|
| Title |
Algorithms and Computation in Mathematics, |
| International Standard Serial Number |
1431-1550 ; |
| Volume number/sequential designation |
5 |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Prefaces -- 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 -- Appendix A: Some NP-Complete Problems -- Appendix B: Solutions -- Appendix C: List of Symbols -- References -- Index. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
From the reviews of the previous editions ".... 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. ..." K.Engel, Mathematical Reviews 2002 The substantial development effort of this text, involving multiple editions and trailing in the context of various workshops, university courses and seminar series, clearly shows through in this new edition with its clear writing, good organisation, comprehensive coverage of essential theory, and well-chosen applications. The proofs of important results and the representation of key algorithms in a Pascal-like notation allow this book to be used in a high-level undergraduate or low-level graduate course on graph theory, combinatorial optimization or computer science algorithms. The well-worked solutions to exercises are a real bonus for self study by students. The book is highly recommended. P .B. Gibbons, Zentralblatt für Mathematik 2005 Once again, the new edition has been thoroughly revised. In particular, some further material has been added: more on NP-completeness (especially on dominating sets), a section on the Gallai-Edmonds structure theory for matchings, and about a dozen additional exercises – as always, with solutions. Moreover, the section on the 1-factor theorem has been completely rewritten: it now presents a short direct proof for the more general Berge-Tutte formula. Several recent research developments are discussed and quite a few references have been added. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Mathematics. |
|
|---|
| Topical term or geographic name as entry element |
Computer science. |
|
|---|
| Topical term or geographic name as entry element |
Combinatorics. |
|
|---|
| Topical term or geographic name as entry element |
Mathematical optimization. |
|
|---|
| Topical term or geographic name as entry element |
Mathematics. |
|
|---|
| Topical term or geographic name as entry element |
Combinatorics. |
|
|---|
| Topical term or geographic name as entry element |
Optimization. |
|
|---|
| Topical term or geographic name as entry element |
Mathematics of Computing. |
| 710 2# - ADDED ENTRY--CORPORATE NAME |
|---|
| Corporate name or jurisdiction name as entry element |
SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY |
|---|
| Title |
Springer eBooks |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY |
|---|
| Display text |
Printed edition: |
| International Standard Book Number |
9783642322778 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
http://dx.doi.org/10.1007/978-3-642-32278-5 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
|
| Item type |
E-Book |
