dc:subject
|
shortest-superstring problem, short superstrings, long tours, weight-maximizing variants, traveling-salesman problems, weight-minimizing counterparts, MAX SNP-hard, nontrivial approximation algorithms, directed graphs, undirected graphs
(xsd:string)
|