Complexity and Approximation : Combinatorial Optimization Problems and Their Approximability Properties

Ausiello, Giorgio/ Crescenzi, Pierluigi/ Gambosi, Giorgio

Springer-Verlag Berlin and Heidelberg GmbH & Co. K（2013/10発売）

ただいまウェブストアではご注文を受け付けておりません。 ⇒古書を探す

製本 Paperback:紙装版/ペーパーバック版／ページ数 524 p.
言語 ENG
商品コード 9783642635816
DDC分類 519.3

Full Description

, 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.