Approximation schemes for minimum latency problems

Keyphrases

• Approximation Scheme 100%
• General Metric 100%
• Minimum Latency Problem 100%
• Polynomial Time 50%
• Time of Arrival 50%
• Planar Graph 50%
• Traveling Salesman Problem 50%
• Quasi-polynomial Time Approximation Scheme 50%
• Constant-factor Approximation Algorithm 50%
• Weighted Tree 50%
• Polynomial-time Approximation Algorithm 50%
• Traveling Repairman Problem 50%
• Kleinberg 50%

Mathematics

• Polynomial Time 100%
• Minimizes 33%
• Arrival Time 33%
• Traveling Salesman Problem 33%
• Constant Factor 33%
• Weighted Tree 33%
• Repairman 33%
• Metric Case 33%
• Planar Graph 33%