000 04117nam a22005057a 4500
001 sulb-eb0024060
003 BD-SySUS
005 20160413122423.0
007 cr nn 008mamaa
008 121116s2013 gw | s |||| 0|eng d
020 _a9783642322785
_9978-3-642-32278-5
024 7 _a10.1007/978-3-642-32278-5
_2doi
050 4 _aQA164-167.2
072 7 _aPBV
_2bicssc
072 7 _aMAT036000
_2bisacsh
082 0 4 _a511.6
_223
100 1 _aJungnickel, Dieter.
_eauthor.
245 1 0 _aGraphs, Networks and Algorithms
_h[electronic resource] /
_cby Dieter Jungnickel.
250 _a4th ed. 2013.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2013.
300 _aXX, 676 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aAlgorithms and Computation in Mathematics,
_x1431-1550 ;
_v5
505 0 _aPrefaces -- 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 _aFrom 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 _aMathematics.
650 0 _aComputer science
_xMathematics.
650 0 _aMathematical optimization.
650 0 _aCombinatorics.
650 1 4 _aMathematics.
650 2 4 _aCombinatorics.
650 2 4 _aOptimization.
650 2 4 _aMathematics of Computing.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642322778
830 0 _aAlgorithms and Computation in Mathematics,
_x1431-1550 ;
_v5
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-32278-5
912 _aZDB-2-SMA
942 _2Dewey Decimal Classification
_ceBooks
999 _c46152
_d46152