Back to Results
First PageMeta Content
Ordinal numbers / Logic / Ordinal arithmetic / Set theory / Curry–Howard correspondence / Mathematical logic / Proof theory / Mathematics


Fast Additive Constant Approximation Algorithms for The Safe Deposit Boxes Problem with Two and Three Currencies Boaz Ben-Moshe1 1 Yefim Dinitz2
Add to Reading List

Document Date: 2008-10-28 21:26:42


Open Document

File Size: 183,75 KB

Share Result on Facebook

City

Duality / /

Country

Israel / /

Currency

USD / EUR / /

Facility

Ben-Gurion University / /

IndustryTerm

extreme-point fractional solution / certain quasi-optimal solution / parametric search approach / combinatorial algorithms / feasible solution / approximation algorithm / quasi-optimal solution / binary search / naive algorithm / parametric search techniques / quasioptimal solution / binary search rule / combinatorial algorithm / search area / runtime algorithm / fractional solution / optimum solution / few non-trivial approximation algorithms / binary search algorithm / /

NaturalFeature

#B waterfall / #C fall / #A waterfall / #X falls / /

Organization

Yefim Dinitz2 Department of Computer Science / Ariel University Center of Samaria / Department of Computer Science / Ben-Gurion University / /

Technology

runtime algorithm / combinatorial algorithm / approximation algorithm / few non-trivial approximation algorithms / Additive Constant Approximation Algorithms / naive algorithm / binary search algorithm / Using Algorithm / Operating Systems / /

SocialTag