Funder
Coordination of Higher Education Personnel Improvement
National Council for Scientific and Technological Development
State of Sao Paulo Research Foundation
Reference30 articles.
1. New approximation algorithms for (1,2)-TSP;Adamaszek,2018
2. Polynomial time approximation schemes for Euclidean Traveling Salesman and other geometric problems;Arora;J. ACM,1998
3. Classical approximation schemes for the ground-state energy of quantum and classical Ising spin Hamiltonians on planar graphs;Bansal;Quantum Inf. Comput.,2009
4. 8/7-approximation algorithm for (1,2)-TSP;Berman,2006
5. A polynomial-time approximation scheme for Euclidean Steiner forest;Borradaile;ACM Trans. Algorithms,2015