| Document Date: 2008-10-28 21:30:52
Open Document File Size: 188,97 KBShare Result on Facebook
City Moscow / Reading / Duality / Ottawa / / Company John Wiley and Sons / Vertex / / Country Jordan / Israel / / Currency USD / EUR / / / Facility Institute of Control Sci / Ben-Gurion University / College of Judea / / IndustryTerm extreme-point fractional solution / certain quasi-optimal solution / parametric search approach / combinatorial algorithms / feasible solution / serial algorithms / quasi-optimal solution / binary search / naive algorithm / parametric search techniques / binary search rule / combinatorial algorithm / search area / runtime algorithm / fractional solution / parallel computation algorithms / few non-trivial approximation algorithms / binary search algorithm / / Organization Institute of Control Sci / College of Judea and Samaria / Department of Computer Science / Ben-Gurion University / / Person H. W. Lenstra / Jr. / Boaz Ben-Moshe / / ProvinceOrState Massachusetts / Ontario / / Technology suggested algorithms / runtime algorithm / parallel computation algorithms / combinatorial algorithm / few non-trivial approximation algorithms / naive algorithm / binary search algorithm / Operating Systems / /
SocialTag |
CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Fast Additive Constant Approximation Algorithms for The Safe Deposit Boxes Problem with Two and Three Currencies Boaz Ben-Moshe∗