Constant-factor approximations for Capacitated Arc Routing without triangle inequality

Математика

• Approximation 31%
• Approximation Algorithms 10%
• Arc Routing 100%
• Costs 18%
• NP-complete problem 9%
• Polynomial-time Algorithm 11%
• Routing Problem 79%
• Triangle inequality 76%
• Undirected Graph 11%

Экономика и предпринимательство

• Approximation 51%
• Approximation Algorithms 15%
• Costs 9%
• Factors 21%
• Graph 11%
• NP-hard 13%
• Polynomials 12%
• Routing 68%
• Routing Problem 77%

Технические дисциплины и материаловедение

• Approximation algorithms 33%
• Costs 23%
• NP-hard 30%
• Polynomials 24%