A Polynomial-Time Linear Decision Tree for the Traveling Salesman Problem and Other NP-Complete Problems.
Kolinek, M.
Discrete & computational geometry, Tome 2 (1987), p. 37-48 / Harvested from Göttinger Digitalisierungszentrum
Access to full text
Publié le : 1987-01-01
EUDML-ID : urn:eudml:doc:131008 
@article{GDZPPN000363294,
     title = {A Polynomial-Time Linear Decision Tree for the Traveling Salesman Problem and Other NP-Complete Problems.},
     journal = {Discrete \& computational geometry},
     volume = {2},
     year = {1987},
     pages = {37-48},
     zbl = {0621.90054},
     url = {http://dml.mathdoc.fr/item/GDZPPN000363294}
}

Kolinek, M. A Polynomial-Time Linear Decision Tree for the Traveling Salesman Problem and Other NP-Complete Problems.. Discrete & computational geometry, Tome 2 (1987) pp. 37-48. http://gdmltest.u-ga.fr/item/GDZPPN000363294/