Dies ist eine Übersichtsseite mit Metadaten zu dieser wissenschaftlichen Arbeit. Der vollständige Artikel ist beim Verlag verfügbar.
Combinatorial Optimization: Algorithms and Complexity.
6.030
Zitationen
3
Autoren
1984
Jahr
Abstract
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 NPcomplete problems, more. All chapters are supplemented by thoughtprovoking 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.
Ähnliche Arbeiten
Solutions of Ill-Posed Problems.
1978 · 8.187 Zit.
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
2007 · 7.094 Zit.
Identity-Based Encryption from the Weil Pairing
2001 · 6.988 Zit.
Fully homomorphic encryption using ideal lattices
2009 · 6.405 Zit.
The Byzantine Generals Problem
1982 · 5.892 Zit.