Free Shipping Over $89 - Limited Time Only - T&C's Apply
Track My Order
Help Centre
Likes
My Wish ListsLogin / Join
Booktopia
Australia's local bookstore
Get Free Shipping on orders over $89
Combinatorial Optimization : Algorithms and Complexity - Christos H. Papadimitriou

Combinatorial Optimization

Algorithms and Complexity

By: Christos H. Papadimitriou, Kenneth Steiglitz

eText | 26 April 2013 | Edition Number 1

At a Glance

eText

$33.69

or 4 interest-free payments of $8.42 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

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.

on
Desktop
Tablet
Mobile

You Can Find This eBook In

Non-FictionMathematicsCombinatorics & Graph TheoryProbability & Statistics

More in Combinatorics & Graph Theory

Linear Algebraic Monoids - Lex E. Renner

eTEXT

Linear Algebraic Monoids

eText

$159.01

This product is categorised by