1 citations · 1 across the 4 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
Chun-Hsiang Chan, Bundit Laekhanukit, Hao-Ting Wei +1
In the k-Connected Directed Steiner Tree problem (k-DST), we are given a directed graph G=(V, E) with edge (or vertex) costs, a root vertex r, a set of q terminals T, and a connect…
cs.DS2019
Waiting is not easy but worth it: the online TSP on the line revisited
Pei-Chuan Chen, Erik D. Demaine, Chung-Shou Liao +1
We consider the online traveling salesman problem on the real line (OLTSPL) in which a salesman begins at the origin, traveling at no faster than unit speed along the real line, an…