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 wellchosen 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 selfcontained.
..." K.Engel, Mathematical Reviews 2002The 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 wellchosen applications.
The proofs of important results and the representation of key algorithms in a Pascallike notation allow this book to be used in a highlevel undergraduate or lowlevel graduate course on graph theory, combinatorial optimization or computer science algorithms.
The wellworked solutions to exercises are a real bonus for self study by students.
The book is highly recommended.
P .B.
Gibbons, Zentralblatt fr Mathematik 2005Once again, the new edition has been thoroughly revised.
In particular, some further material has been added: more on NPcompleteness (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 1factor 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 beenadded.
Teslim edilmediğinde para iadesi
