Siirry suoraan sisältöön
Complexity and Approximation
Tallenna

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.
Alaotsikko
Combinatorial Optimization Problems and Their Approximability Properties
Painos
Softcover reprint of the original 1st ed. 1999
ISBN
9783642635816
Kieli
englanti
Paino
310 grammaa
Julkaisupäivä
3.10.2013
Sivumäärä
524