Combinatorial Optimization (eBook)

Algorithms and Complexity

Christos H. Papadimitriou, Kenneth Steiglitz (Autoren)

eBook Download: EPUB

2013
528 Seiten
Dover Publications (Verlag)
978-0-486-32013-7 (ISBN)

Infos

This graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; local search heuristics for NP-complete problems, more. 1982 edition.

---

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. "e;Mathematicians wishing a self-contained introduction need look no further."e; — American Mathematical Monthly.

Produkt-Details

• Erscheint lt. Verlag: 26.4.2013
• Reihe/Serie: Dover Books on Computer Science
• Sprache: englisch
• Themenwelt: Mathematik / Informatik ► Mathematik ► Graphentheorie
• Schlagworte: abstract algebra • advanced concepts • Algebraic • algorithms • Andrews • Approximation • arithmetic • bipartite • books on abstract algebras • books on advanced concepts • books on algorithms • books on andrews • books on approximations • books on arithmetics • books on chaps • books on classic texts • books on combinatorics • books on computabilities • books on computational complexities • books on convices • books on dijkstra • books on dualities • books on education majors • books on exercises • books on graph theories • books on heuristics • books on integers • books on intersections • books on labelings • books on lemma • books on liberal arts • books on linear programmings • books on local searches • books on mathematics • books on odd times • books on optimisations • books on optimizations • books on partitions • books on polytopes • books on proofs • books on theory classes • CHAP • classic text • combinatorial • combinatorics • Computability • Computational Complexity • Convex • Dijkstra • Dual • Duality • education majors • Exercises • Finiteness • generate • generating • Geometric • graph theory • Heuristics • Integer • Intersection • Labeling • Lemma • Liberal Arts • Linear Programming • Local Search • Match • Matching • Mathematical • Mathematics • np-complete • odd times • one-semester • optimisation • Optimization • Partitioning • Partitions • pleasant memories • polytopes • primitive roots • proofs • Quadratic • Spanning • Theorem • theory class • wait awhile • waiting awhile
• ISBN-10: 0-486-32013-8 / 0486320138
• ISBN-13: 978-0-486-32013-7 / 9780486320137