2012 Puddly Awards
 
 
Follow us on TwitterFollow us on FacebookFollow us on Google+Follow us on TumblrSubscribe to RSS

Recently Viewed clear list

Book News | May 25, 2012

Chris Guillebeau: IMG Don't Polish Your Resume, Opt Out of the Whole System

0 comments By Chris Guillebeau

Have you ever met a barista with a college degree? What about one with a master's degree? Spend time in Portland, or likely any other major city in... Continue »
spacer
Ships free on qualified orders.
$8.95
Used Trade Paper
Ships in 1 to 3 days
Add to Wishlist
Qty Store Section
1 Local Warehouse Software Engineering- Algorithms

This title in other editions

Combinatorial Optimization: Algorithms and Complexity

by Chris Papadimitriou

Combinatorial Optimization: Algorithms and Complexity Cover

 

Synopses & Reviews

Publisher Comments:

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.

Book News Annotation:

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. Book News, Inc., Portland, OR (booknews.com)

Synopsis:

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.

Synopsis:

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 problem

Synopsis:

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

back to top
back to top

Product Details

ISBN:
9780486402581
Subtitle:
Algorithms and Complexity
Author:
Papadimitriou, Christos H.
Author:
Papadimitriou, Christos H.
Author:
Steiglitz, Kenneth
Publisher:
Dover Publications
Location:
Mineola, N.Y. :
Subject:
Mathematical Analysis
Subject:
Machine Theory
Subject:
Mathematical optimization
Subject:
Combinatorics
Subject:
Computational complexity
Subject:
Combinatorial optimization
Subject:
General Mathematics
Subject:
Mathematics-Combinatorics
Copyright:
1982
Edition Description:
Trade Paper
Series:
Dover Books on Computer Science
Publication Date:
19980129
Binding:
Paperback
Language:
English
Illustrations:
Yes
Pages:
528
Dimensions:
8.5 x 5.38 in 1.23 lb
back to top

Other books you might like

  1. $16.95 New Trade Paper add to wish list

    Regular Polytopes 3RD Edition

    H S M Coxeter 9780486614809
  2. $89.95 New Trade Paper add to wish list

    Classification and Regression Trees

    Leo Breiman 9780412048418
  3. $24.95 New Trade Paper add to wish list

    Combinatorial Optimization: Networks and Matroids

    Eugene S. Lawler 9780486414539
  4. $3.50 Used Mass Market add to wish list

    Facts from Figures

    M J Moroney 9780140202366
  5. $8.50 Used Trade Paper add to wish list

    Number Theory and Its History (Dover Classics of Science & Mathematics)

    Oystein Ore 9780486656205
  6. $14.95 New Trade Paper add to wish list

    The Beauty of Geometry: Twelve Essays

    H. S. M. Coxeter 9780486409191
back to top

Related Subjects

Computers and Internet » Software Engineering » Algorithms
Reference » Science Reference » General
Science and Mathematics » Mathematics » Combinatorics

Combinatorial Optimization: Algorithms and Complexity Used Trade Paper
0 stars - 0 reviews
$8.95 In Stock
Product details 528 pages Dover Publications - English 9780486402581 Reviews:
"Synopsis" by ,
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.
"Synopsis" by , 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 problem
"Synopsis" by ,
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.
.
spacer
spacer
  • back to top
Follow us on...



Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and eBooks — here at Powells.com.