Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems

Keyphrases

• Approximating Set 100%
• Approximation Algorithms 25%
• Directed Steiner Tree 25%
• Exponential Time Hypothesis 25%
• Label Cover 25%
• N-factor 50%
• N-time 25%
• PCP Theorem 25%
• Polymatroid 25%
• Projection Games Conjecture 25%
• Set Cover 100%
• Subexponential 100%
• Submodular Cover 25%
• Tight Bounds 100%
• Tight Lower Bound 25%
• Time Approximation 100%

Mathematics

• Exp 100%
• Exponential Time 33%
• Upper Bound 33%