| 000 | 02700cam a22004575i 4500 | ||
|---|---|---|---|
| 001 | 11308929 | ||
| 003 | UoK | ||
| 005 | 20180911145036.0 | ||
| 006 | m d | ||
| 007 | cr n | ||
| 008 | 130417s1999 gw | s |||| 0|eng d | ||
| 020 | _a9783662038222 | ||
| 020 | _a9788181285188 | ||
| 024 | 7 |
_a10.1007/978-3-662-03822-2 _2doi |
|
| 035 | _a(WaSeSS)ssj0001090874 | ||
| 040 |
_dlcc _alcc _clcc |
||
| 050 | 4 | _aQA164-167.2 | |
| 072 | 7 |
_aPBV _2bicssc |
|
| 072 | 7 |
_aMAT036000 _2bisacsh |
|
| 082 | 0 | 4 |
_a511.6 _223 |
| 100 | 1 |
_aJungnickel, Dieter. _eauthor. |
|
| 210 | 1 | 0 | _aGraphs, Networks and Algorithms |
| 245 | 1 | 0 |
_aGraphs, Networks and Algorithms _cby Dieter Jungnickel. |
| 300 |
_axvi,611p.; _billus. |
||
| 490 | 1 |
_aAlgorithms and Computation in Mathematics, _x1431-1550 ; _v5 |
|
| 504 | _aIncludes bibliographic references and index. | ||
| 505 | 0 | _a1. Basic Graph Theory -- 2. Algorithms and Complexity -- 3. Shortest Paths -- 4. Spanning Trees -- 5. The Greedy Algorithm -- 6. Flows -- 7. Applications in Combinatorics -- 8. Colourings -- 9. Circulations -- 10. Synthesis of Networks -- 11. Connectivity -- 12. Matchings -- 13. Weighted Matchings -- 14. A Hard Problem: The TSP -- A. Solutions -- B. List of Symbols -- References. | |
| 506 | _aLicense restrictions may limit access. | ||
| 520 | _aFrom the reviews of the German edition: "Combinatorial optimization, along with graph algorithms and complexity theory is booming. This book treats the most prominent problems which are polynomially solvable. The Traveling Salesman Problem is discussed as a paradigm of an NP-complete problem. The text is well written, most exercises are quite enlightening and the hints are clear. Algorithms are described very thoroughly. The list of references is impressive and gives good guidance for further reading. The book can be recommended to beginners as an introductory text as well as for research and industry as a reference." (OPTIMA) In this corrected 2nd printing of the first edition the author has made some small modifications: some minor mistakes were corrected and updates to the bibliography provided. | ||
| 650 | 0 | _aMathematics. | |
| 650 | 0 | _aCombinatorics. | |
| 650 | 1 | 4 | _aMathematics. |
| 650 | 2 | 4 | _aCombinatorics. |
| 773 | 0 | _tSpringer eBooks | |
| 773 | 0 | _tSpringerLink ebooks - Mathematics and Statistics (Archive) | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783662038246 |
| 830 | 0 |
_aAlgorithms and Computation in Mathematics, _v5 |
|
| 856 | 4 | 0 |
_uhttp://www.columbia.edu/cgi-bin/cul/resolve?clio11308929 _zFull text available from SpringerLink ebooks - Mathematics and Statistics (Archive) |
| 910 | _aVendor-generated brief record | ||
| 942 |
_2lcc _cLL |
||
| 999 |
_c412 _d412 |
||