Combinatorial optimization : algorithms and complexity / Christos H. Papadimitriou, Kenneth Steiglitz.

By:

Papadimitriou, Christos H

Contributor(s):

Steiglitz, Kenneth

Material type: Text

TextSeries: Dover books on computer sciencePublication details: [S.l.] : Dover Publications, 1998.Edition: UnabridgedDescription: 528 p. ; 22 cmISBN:

0486402584 (paperback)
9780486402581 (paperback)

Online resources:

Amazon.com

Summary: 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

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode
Book	Air University Central Library Islamabad	NFIC	519.6 PAP (Browse shelf(Opens below))	Available		P7222

Unabridged.

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

There are no comments on this title.

to post a comment.