लोड हो रहा है...
[Formula: see text]-Approximation for Graphic TSP
The Travelling Salesman Problem is one of the fundamental and intensively studied problems in approximation algorithms. For more than 30 years, the best algorithm known for general metrics has been Christofides’s algorithm with an approximation factor of [Formula: see text], even though the so-calle...
में बचाया:
| में प्रकाशित: | Theory Comput Syst |
|---|---|
| मुख्य लेखक: | |
| स्वरूप: | Artigo |
| भाषा: | Inglês |
| प्रकाशित: |
Springer US
2012
|
| विषय: | |
| ऑनलाइन पहुंच: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4538985/ https://ncbi.nlm.nih.gov/pubmed/26300685 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/s00224-012-9439-7 |
| टैग : |
टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|