登入選單
返回Google圖書搜尋
其他書名
Algorithms and Complexity
出版Courier Corporation, 2013-04-26
主題Mathematics / Combinatorics
ISBN04863201389780486320137
URLhttp://books.google.com.hk/books?id=BSPCAgAAQBAJ&hl=&source=gbs_api
EBookSAMPLE
註釋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.