Improved algorithms for orienteering and related problems

Keyphrases

• Improved Algorithm 100%
• Directed Graph 100%
• Undirected Graph 100%
• Orienteering 100%
• Orienteering Problem 100%
• Approximation Algorithms 50%
• Log 2 50%
• Logarithmic Approximation 50%
• Network Design Problem 50%
• Quasi-polynomial Time Algorithms 50%
• K-MST 50%
• 2-opt 50%
• Improved Approximation 50%
• Edge-weighted Graph 50%
• 2-approximation 50%

Mathematics

• Orienteering Problem 100%
• Edge 50%
• Polynomial Time 50%
• Main Result 50%
• Total Length 50%
• weighted graph 50%
• Minimum Spanning Tree 50%

Computer Science

• Directed Graphs 100%
• Approximation (Algorithm) 75%
• Approximation Algorithms 25%
• polynomial-time algorithm 25%
• weighted graph 25%
• Network Design Problem 25%
• Logarithmic Approximation 25%