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.

ÖVRIGT:
Mediatyp: Bok
Bandtyp: Häftad
Författare: Kenneth Steiglitz
Förlag: Dover Publications
Språk: Engelska
Omfång: 528 sidor
Mått (bxhxd): 140x216x27 mm
Vikt: 625 gram
Illustrerad: Nej
Serie: DOVER BOOKS ON COMPUTER SCIENC

Streckkod: 9780486402581
SKU: 923426