BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)

Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)

Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer
Stock photo: cover may vary

Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science) Paperback - 1998

by Papadimitriou, Christos H.; Steiglitz, Kenneth

Add to wish list
  • Used
  • very good
Used - Very good

Description

Dover Publications. Unabridged. Very Good. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.
Ask the seller a question Add to wish list
A$12.86
Free Delivery within USA
Standard delivery: 7 to 14 days
More delivery options
Ships from BooksRun (Pennsylvania, United States)

Details

About BooksRun Pennsylvania, United States

Specialising in: Textbooks
Biblio member since 2016

BooksRun - best place to buy, sell or rent cheap textbooks

Terms of Sale:

30 days return guarantee. 10% restocking fee applies to discretionary returns

Browse books from BooksRun

Reader reviews for Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)

From the publisher

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