10 citations · 19 across the 5 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020★ 10 cited
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods
Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit +1
We study the variant of the Euclidean Traveling Salesman problem where instead of a set of points, we are given a set of lines as input, and the goal is to find the shortest tour t…
cs.DS2020★ 1 cited
Vertex Sparsification for Edge Connectivity
Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit +5
Graph compression or sparsification is a basic information-theoretic and computational question. A major open problem in this research area is whether -approximate cut-prese…