Fast additive constant approximation algorithms for the safe deposit boxes problem with two and three currencies

Keyphrases

• Constant-factor Approximation Algorithm 100%
• Absolute Error 100%
• Degenerate Case 100%
• Additive Constant 100%
• Deposit Boxes 100%
• 2D to 3D 50%
• NP-hard 50%
• Non-degenerate 50%
• Minimal number 50%
• Knapsack Problem 50%
• Megiddo 50%
• Parametric Search 50%
• Linear Programming Method 50%
• Search Approach 50%
• Combinatorial Algorithms 50%
• Combinatorial Technique 50%
• 2D Algorithm 50%
• 3D Algorithms 50%

Computer Science

• Approximation Algorithms 100%
• Linear Programming 100%
• Knapsack Problem 100%
• Technical Report 100%
• Parametric Search 100%
• Programming Technique 100%

Mathematics

• Absolute Error 100%
• Additive Constant 100%
• Running Time 50%
• Linear Programming 50%
• Minimal Number 50%
• Parametric Search 50%
• Combinatorial Algorithm 50%