Combinatorial Optimization: Algorithms and Complexity

Christos H., Papadimitriou und Steiglitz Kenneth:

ISBN 10: 0131524623 / ISBN 13: 9780131524620

Edité par Prentice Hall, 1982

A propos de cet article

496 Seiten; 9780131524620.3 Gewicht in Gramm: 1.

N° de réf. du vendeur 946666

Détails bibliographiques

• Titre: Combinatorial Optimization: Algorithms and Complexity
• Éditeur: Prentice Hall
• Date de parution: 1982
• Langue: anglais
• ISBN à 10 chiffres: 0131524623
• ISBN à 13 chiffres: 9780131524620
• Reliure: hardcover
• État de l'article: Gut
• Catalogues du vendeur:
  • Varia

A propos de ce titre

Synopsis

Book by Papadimitriou Christos H

Présentation de l'éditeur

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. 1982 ed.