# A Polynomial-Time Linear Decision Tree for the Traveling Salesman Problem and Other NP-Complete Problems.

Discrete & computational geometry (1987)

- Volume: 2, page 37-48
- ISSN: 0179-5376; 1432-0444/e

## Access Full Article

top## How to cite

topKolinek, M.. "A Polynomial-Time Linear Decision Tree for the Traveling Salesman Problem and Other NP-Complete Problems.." Discrete & computational geometry 2 (1987): 37-48. <http://eudml.org/doc/131008>.

@article{Kolinek1987,

author = {Kolinek, M.},

journal = {Discrete & computational geometry},

keywords = {linear incidence geometry; computational geometry; hyperplanes; linear decision tree; affine tests; n-city Traveling Salesman Problem},

pages = {37-48},

title = {A Polynomial-Time Linear Decision Tree for the Traveling Salesman Problem and Other NP-Complete Problems.},

url = {http://eudml.org/doc/131008},

volume = {2},

year = {1987},

}

TY - JOUR

AU - Kolinek, M.

TI - A Polynomial-Time Linear Decision Tree for the Traveling Salesman Problem and Other NP-Complete Problems.

JO - Discrete & computational geometry

PY - 1987

VL - 2

SP - 37

EP - 48

KW - linear incidence geometry; computational geometry; hyperplanes; linear decision tree; affine tests; n-city Traveling Salesman Problem

UR - http://eudml.org/doc/131008

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.