MARC Record from harvard_bibliographic_metadata

LEADER: 03752nam a22004215a 4500
001 013507725-7
005 20130104190411.0
008 121116s2013 gw | s ||0| 0|eng d
020 $a9783642322785
020 $a9783642322785
020 $a9783642322778
024 7 $a10.1007/978-3-642-32278-5$2doi
035 $a(Springer)9783642322785
040 $aSpringer
050 4 $aQA164-167.2
072 7 $aPBV$2bicssc
072 7 $aMAT036000$2bisacsh
082 04 $a511.6$223
100 1 $aJungnickel, Dieter.
245 10 $aGraphs, Networks and Algorithms /$cby Dieter Jungnickel.
250 $a4th ed. 2013.
260 $aBerlin, Heidelberg :$bSpringer Berlin Heidelberg :$bImprint: Springer,$c2013.
300 $aXX, 675 p. 211 illus.$bdigital.
490 0 $aAlgorithms and Computation in Mathematics,$x1431-1550 ;$v5
505 0 $a<p>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.</p>.
520 $a<p>From the reviews of the previous editions </p><p>".... 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 </p><p>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 </p><p>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.</p>
650 20 $aCombinatorial analysis.
650 10 $aMathematics.
650 0 $aCombinatorial analysis.
650 0 $aMathematics.
650 0 $aComputer science.
650 0 $aMathematical optimization.
650 24 $aOptimization.
650 24 $aMathematics of Computing.
776 08 $iPrinted edition:$z9783642322778
830 0 $aAlgorithms and computation in mathematics ;$v5.
988 $a20121205
906 $0VEN