10 citations · 19 across the 5 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019★ 3 cited
Mimicking Networks Parameterized by Connectivity
Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit +1
Given a graph , capacities on edges, and a subset of terminals , a mimicking network for is a graph $(…
cs.DS2019
On Approximating Degree-Bounded Network Design Problems
Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit +3
Directed Steiner Tree (DST) is a central problem in combinatorial optimization and theoretical computer science: Given a directed graph with edge costs $c \in \mathbb{R}…