Exécution de notre outil de synthèse sur un nouvel article

Vérifiez l’article ci-dessous, puis lancez sa synthèse.


An LP-based 3/2-approximation algorithm for the graphic s-t path TSP

Zhihan Gao

Licence : CC BY-NC-SA 3.0

Résumé : We design a new LP-based algorithm for the graphic $s$-$t$ path Traveling Salesman Problem (TSP), which achieves the best approximation factor of 1.5. The algorithm is based on the idea of narrow cuts due to An, Kleinberg, and Shmoys. It partly answers an open question of Sebő.

Soumis à arXiv le 26 Avr. 2013