Combinatorial Optimization

Algorithms and Complexity

Christos H. Papadimitriou, Kenneth Steiglitz (Autoren)

Buch | Softcover

528 Seiten

2000 | Reprint
Dover Publications Inc. (Verlag)
978-0-486-40258-1 (ISBN)

Artikel merken

This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a self-contained introduction need look no further." — American Mathematical Monthly.

Reprint of the Prentice-Hall, Englewood Cliffs, New Jersey, 1982 edition.

Erscheint lt. Verlag	1.2.2000
Reihe/Serie	Dover Books on Computer Science
Verlagsort	New York
Sprache	englisch
Maße	140 x 216 mm
Gewicht	524 g
Einbandart	Paperback
Themenwelt	Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
	Mathematik / Informatik ► Mathematik ► Finanz- / Wirtschaftsmathematik
	Mathematik / Informatik ► Mathematik ► Graphentheorie
ISBN-10	0-486-40258-4 / 0486402584
ISBN-13	978-0-486-40258-1 / 9780486402581
Zustand	Neuware