17 citations · 17 across the 2 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.CG2025
Approximation and Hardness of Polychromatic TSP
Thomas Schibler, Subhash Suri, Jie Xue
We introduce the Polychromatic Traveling Salesman Problem (PCTSP), where the input is an edge weighted graph whose vertices are partitioned into equal-sized color classes, and…
cs.CG2025
Embedding Graphs as Euclidean kNN-Graphs
T. Schibler, S. Suri, J. Xue
Let G = (V, E) be a directed graph on n vertices where each vertex has out-degree k. We say that G is kNN-realizable in d-dimensional Euclidean space if there exists a point set P…