| Document Date: 2009-02-09 09:48:52
Open Document File Size: 285,67 KBShare Result on Facebook
Company Microsoft / / / Facility Brown University / University of Bonn / / IndustryTerm polynomial-time approximation algorithms / additive-error solution / approximation algorithm / additive error approximation algorithm / linear-time algorithms / additive approximation algorithm / additive error algorithms / then doing exhaustive search / ǫ-approximation algorithm / linear-time algorithm / additive error approximation algorithms / nk additive approximation algorithm / additive error algorithm / iterative applications / / Organization Hausdorff Center for Mathematics / Brown University / University of Bonn / / Person David Gale / Write Obj / Fernandez de la Vega / / / Position RT / / Product Pentax K-x Digital Camera / Sj / / ProgrammingLanguage D / / RadioStation Fm 2 / / Technology ǫ-approximation algorithm / additive approximation algorithm / 2.3 Algorithm / polynomial-time approximation algorithms / linear-time algorithms / approximation algorithm / 1 Our algorithm / additive error algorithms / 2 algorithm / known additive error approximation algorithms / additive error approximation algorithm / linear-time algorithm / /72k nk additive approximation algorithm / 5 Algorithm / additive error algorithm / 2 2.1 Fragile-dense Algorithm / /
SocialTag |
Linear Time Approximation Schemes for the Gale-Berlekamp Game and Related Minimization Problems Marek Karpinski∗ and Warren Schudy† Abstract