Efficient Algorithms and Hardness Results for the Weighted k-Server Problem

Computer Science

• Efficient Algorithm 100%
• Competitive Ratio 100%
• on-line algorithm 50%
• Randomized Algorithm 50%
• Polynomial Time 50%
• approximation factor 50%
• polynomial-time algorithm 50%
• Primal-Dual 50%
• Polynomial Approximation 50%

Mathematics

• Polynomial Time 100%
• Competitive Ratio 100%
• Exp 50%
• Rounding 50%
• Polynomial Approximation 50%

Keyphrases

• Resource Augmentation 40%
• Computational Lower Bounds 20%