New edition
Paperback (01 Feb 2000)
Save $5.30
Includes delivery to the United States
10 copies available online - Usually dispatched within two working days
free Reserve & collect
Copies available at Blackwell's Oxford Broad Street
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.
| ISBN: | 9780486402581 |
| Publisher: | Dover Publications Inc |
| Imprint: | Search Press |
| Pub date: | 01 Feb 2000 |
| Edition: | New edition |
| DEWEY: | 519.3 |
| DEWEY edition: | 21 |
| Language: | English |
| Number of pages: | 496 |
| Weight: | 644g |
| Height: | 214mm |
| Width: | 136mm |
| Spine width: | 26mm |
$2.83off
Combinatorics
Paperback
Published 28 Apr 2016
Save $2.83
$0.88off
The Fascinating World of Graph ...
Paperback
Published 13 Jun 2017
Save $0.88
$13.03off
Graph Theory
Paperback
Published 30 Mar 2020
Save $13.03
$11.64off
Surveys in Combinatorics 2024
Paperback
Published 13 Jun 2024
Save $11.64
$5.04off
Fundamentals of Ramsey Theory
Paperback
Published 26 Aug 2024
Save $5.04
$6.18off
Introducing Game Theory and Its...
Paperback
Published 02 Aug 2024
Save $6.18
$2.26off
Combinatorics of Permutations
Paperback
Published 26 Aug 2024
Save $2.26
Applied Combinatorics
Hardback
Published 04 Sep 2024
$4.27off
Handbook of the Tutte Polynomia...
Paperback
Published 26 Aug 2024
Save $4.27
Introducing Game Theory and Its...
Hardback
Published 02 Aug 2024