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.

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Descripci�n de la librer�a

There's nothing better to clear the cobwebs of the Grumps than curling up with a good book! Find thousands of good reads and lighten your mood with Grumpy's Fine Books!

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

Grumpys Fine Books
NM, U.S.A.

Condiciones de venta:

I accept all returns within 30 days of delivery and will provide prepaid return shipping labels upon request.

Condiciones de env�o:

I charge shipping to cover USPS Media Mail rate, unless Priority Mail is chosen. Those items will be shipped via USPS Priority Mail. I do not offer UPS or Fedex shipment at this time.
All items are packaged in the most secure way possible so as to avoid damage in transit.

M�todos de pago
aceptados por la librer�a

A�adir una petici�n

Art�culos relacionados a Combinatorial Optimization: Algorithms and Complexity...

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

Papadimitriou, Christos H.

Nuevos - Encuadernaci�n de tapa blanda

Informaci�n empresarial del vendedor