Home | Best Seller | FAQ | Contact Us
Browse
Art & Photography
Biographies & Autobiography
Body,Mind & Health
Business & Economics
Children's Book
Computers & Internet
Cooking
Crafts,Hobbies & Gardening
Entertainment
Family & Parenting
History
Horror
Literature & Fiction
Mystery & Detective
Nonfiction
Professional & Technology
Reference
Religion
Romance
Science
Science Fiction & Fantasy
Sports & Outdoors
Travel & Geography
   Book Info

enlarge picture

Combinatorial Optimization : Algorithms and Complexity [UNABRIDGED]  
Author: Christos H. Papadimitriou, Kenneth Steiglitz
ISBN: 0486402584
Format: Handover
Publish Date: June, 2005
 
     
     
   Book Review


From Book News, Inc.
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. Book News, Inc.®, Portland, OR


Book Description
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."�7American Mathematical Monthly. 1982 ed.





Combinatorial Optimization: Algorithms and Complexity

FROM THE PUBLISHER

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. 1982 ed.

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. 1982 ed.

FROM THE CRITICS

Booknews

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.

     



Home | Private Policy | Contact Us
@copyright 2001-2005 ReadingBee.com