Titlebook: Algorithmics for Hard Problems; Introduction to Comb Juraj Hromkovi? Textbook 2004Latest edition Springer-Verlag Berlin Heidelberg 2004 Tex

Prophylaxis

繼承人

Intend

Fecundity

Algorithmics for Hard Problems978-3-662-05269-3Series ISSN 1862-4499 Series E-ISSN 1862-4502

intoxicate

橡子

978-3-642-07909-2Springer-Verlag Berlin Heidelberg 2004

CAPE

滲入

Texts in Theoretical Computer Science. An EATCS Serieshttp://image.papertrans.cn/a/image/153019.jpg

Merited

https://doi.org/10.1007/978-3-0348-6443-5-time algorithms. are known. It focuses on a . presentation of the fundamental concepts and algorithm design techniques such as pseudopolynomial-time algorithms, parameterized complexity, branch-and-bound, local search, lowering the worst case complexity of exponential algorithms, dual approximation

隼鷹