11 citations · 32 across the 20 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DS2011
Steiner Forest Orientation Problems
Marek Cygan, Guy Kortsarz, Zeev Nutov
We consider connectivity problems with orientation constraints. Given a directed graph and a collection of ordered node pairs let $P[D]=\{(u,v) \in P: D {contains a} uv{-pa…
cs.DS2011★ 2 cited
Combinatorial Algorithms for Capacitated Network Design
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz +1
We focus on designing combinatorial algorithms for the Capacitated Network Design problem (Cap-SNDP). The Cap-SNDP is the problem of satisfying connectivity requirements when edges…