Kód: 01566598
During the last few years, we have seen quite spectacular progress in the area of approximation algorithms: for several fundamental optimization problems we now actually know matching upper and lower bounds for their approximabili ... celý popis
Angličtina
Nákupem získáte 118 bodů
Anotace knihy
During the last few years, we have seen quite spectacular progress in the area of approximation algorithms: for several fundamental optimization problems we now actually know matching upper and lower bounds for their approximability. This textbook-like tutorial is a coherent and essentially self-contained presentation of the enormous recent progress facilitated by the interplay between the theory of probabilistically checkable proofsand aproximation algorithms. The basic concepts, methods, and results are presented in a unified way to provide a smooth introduction for newcomers. These lectures are particularly useful for advanced courses or reading groups on the topic.
Parametry knihy
Zařazení knihy Knihy v angličtině Computing & information technology Computer science Mathematical theory of computation
1182 Kč
Angličtina
Osobní odběr Praha, Brno a 47512 dalších
Copyright ©2008-26 nejlevnejsi-knihy.cz Všechna práva vyhrazenaSoukromíCookies
Vrácení do měsíce
571 999 099 (8-15.30h)Nákupní košík ( prázdný )