View Document Preview and Link Document Date: 2010-10-07 20:12:35 Open Document File Size: 181,82 KB Share Result on Facebook
City Baltimore / / Country Japan / United States / / Currency USD / / / Facility Generic Fully Polynomial-Time Approximation Schemes Using Generalised Thinning Shin-Cheng Mu Yu-Han Lyu Institute of Information Science Academia Sinica / Tohoku University / / IndustryTerm electricity / function solutions / morihata@riec.tohoku.ac.jp algorithms / maximal solutions / near-optimal solutions / approximation algorithm / brute force algorithm / greedy algorithm / arbitrary solution / useless solutions / approximate solution / fold fusion law / typical solution / potential solutions / correct solutions / approximate algorithm / table-based algorithm / possible solutions / relation solutions / maximal solution / namely solutions / categorical products / approximate solutions / proximation algorithms / approximation algorithms / / Organization Tohoku University / Constructing Datatype-Generic Fully Polynomial-Time Approximation Schemes Using Generalised Thinning Shin-Cheng Mu Yu-Han Lyu Institute of Information Science Academia Sinica / / Person Shin-Cheng Mu Yu-Han / / Position algorithm designer / General / programmer / / ProgrammingLanguage Haskell / R / / ProvinceOrState Maryland / / Technology resulting approximation algorithm / minimum.3 The algorithm / Japan morihata@riec.tohoku.ac.jp algorithms / FPTAS algorithms / fold-based FPTAS algorithms / approximation algorithm / brute force algorithm / thinning algorithm / corresponding thinning algorithm / table-based algorithm / approximate algorithm / greedy algorithm / approximation algorithms / 4.1 Stepwise Approximation The algorithm / proximation algorithms / designing approximation algorithms / Terms Algorithms / resulting algorithms / Theory Keywords Approximation Algorithms / / SocialTag 
Constructing Datatype-Generic Fully Polynomial-Time Approximation Schemes Using Generalised Thinning Shin-Cheng Mu