192 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Fudan UniversityCN23 papers
- Shanghai Jiao Tong UniversityCN16 papers
- Peking UniversityCN14 papers
- Chinese University of Hong KongHK11 papers
- Tsinghua UniversityCN10 papers
- University of MinnesotaUS9 papers
- Nanyang Technological UniversitySG8 papers
- Hong Kong University of Science and TechnologyHK7 papers
- University of Hong KongHK7 papers
- University of WashingtonUS7 papers
- Stanford UniversityUS6 papers
- University of Minnesota SystemUS6 papers
Showing 2018 · cs.DSShow all
2 papers · 2 filters
cs.DS2018★ 1 cited
-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm
Fabrizio Grandoni, Bundit Laekhanukit, Shi Li
In the Directed Steiner Tree (DST) problem we are given an -vertex directed edge-weighted graph, a root , and a collection of terminal nodes. Our goal is to find a minimu…
cs.DS2018★ 1 cited
On subexponential running times for approximating directed Steiner tree and related problems
Marek Cygan, Guy Kortsarz, Bundit Laekhanukit
This paper concerns proving almost tight (super-polynomial) running times, for achieving desired approximation ratios for various problems. To illustrate, the question we study, le…