11 citations · 32 across the 20 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
Bounded Degree Group Steiner Tree Problems
Guy Kortsarz, Zeev Nutov
We study two problems that seek a subtree of a graph such that satisfies a certain property and has minimal maximum degree. - In the Min-Degree Group Steiner Tree…
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}…