Picture 1 of 1
Stock photo
Picture 1 of 1
Stock photo
Dover Books on Computer Science Ser.: Combinatorial Optimization : Algorithms and Complexity by Kenneth Steiglitz and Christos H. Papadimitriou (1998, Trade Paperback)
Great Book Prices Store (360162)
97.9% positive feedback
Price:
$31.38
Free shipping
Returns:
14 days returns. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Condition:
Combinatorial Optimization : Algorithms and Complexity, Paperback by Papadimitriou, Christos H.; Steiglitz, Kenneth, ISBN 0486402584, ISBN-13 9780486402581, Brand New, Free shipping in the US A text for a range of graduate courses, with some of the material suitable for students of computer science with a background in the theory of algorithms and some suitable for those with a background in operations research. Corrected and unabridged from the 1982 publication by Prentice-Hall, with a new preface. Annotation c. by Book News, Inc., Portland, Or.
- Buy It NowCombinatorial Optimization : Algorithms and Complexity, Paperback by Papadimi...
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
About this product
Product Identifiers
PublisherDover Publications, Incorporated
ISBN-100486402584
ISBN-139780486402581
eBay Product ID (ePID)609901
Product Key Features
Number of Pages528 Pages
Publication NameCombinatorial Optimization : Algorithms and Complexity
LanguageEnglish
SubjectMachine Theory, Combinatorics, Optimization
Publication Year1998
TypeTextbook
Subject AreaMathematics, Computers
AuthorKenneth Steiglitz, Christos H. Papadimitriou
SeriesDover Books on Computer Science Ser.
FormatTrade Paperback
Dimensions
Item Height1 in
Item Weight21.7 Oz
Item Length8.5 in
Item Width5.5 in
Additional Product Features
Intended AudienceCollege Audience
LCCN98-021476
Dewey Edition21
Dewey Decimal519.3
Edition DescriptionUnabridged edition,New Edition
SynopsisThis 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., 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., Clearly written 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; approximation algorithms, local search heuristics for NP-complete problems, more. "Mathematicians wishing a self-contained introduction need look no further." -- American Mathematical Monthly. 1982 edition.
LC Classification NumberQA402.5.P37 1998
All listings for this product
Be the first to write a review
