Spara
Complexity and Approximation
häftad, 2013
Engelska
, 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.
- Undertitel
- Combinatorial Optimization Problems and Their Approximability Properties
- Författare
- Giorgio Ausiello, Pierluigi Crescenzi, Giorgio Gambosi, Viggo Kann, Alberto Marchetti-Spaccamela, Marco Protasi
- Upplaga
- Softcover reprint of the original 1st ed. 1999
- ISBN
- 9783642635816
- Språk
- Engelska
- Vikt
- 310 gram
- Utgivningsdatum
- 2013-10-03
- Sidor
- 524
