autore :  Papadimitriou

1 pubblicazione
page_white_acrobat The Euclidean travelling salesman problem is NP-complete (Theoretical Computer Science, 1977) — Christos H. Papadimitriou