Combinatorial Optimization: Algorithms and ComplexityCourier Corporation, 1 янв. 1998 г. - Всего страниц: 496 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. |
Другие издания - Просмотреть все
Combinatorial Optimization: Algorithms and Complexity Christos H. Papadimitriou,Kenneth Steiglitz Ограниченный просмотр - 2013 |
Combinatorial Optimization: Algorithms and Complexity Christos H. Papadimitriou,Kenneth Steiglitz Ограниченный просмотр - 1998 |
Combinatorial Optimization: Algorithms and Complexity Christos H. Papadimitriou,Kenneth Steiglitz Просмотр фрагмента - 1998 |