Gå direkte til innholdet
Complexity and Approximation
Spar

Complexity and Approximation

, the only way we know to solve it is by making use of an algorithm that runs in exponential time), it may be practically unfeasible to try to compute the exact solution, because it might require months or years of machine time, even with the help of powerful parallel computers.
Undertittel
Combinatorial Optimization Problems and Their Approximability Properties
Opplag
Softcover reprint of the original 1st ed. 1999
ISBN
9783642635816
Språk
Engelsk
Vekt
310 gram
Utgivelsesdato
3.10.2013
Antall sider
524