117 citations · 273 across the 35 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems
Rohan Ghuge, Viswanath Nagarajan
We consider the following general network design problem on directed graphs. The input is an asymmetric metric , root , monotone submodular function $f:2^V\right…
cs.CC2018★ 1 cited
Approximating Max-Cut under Graph-MSO Constraints
Martin Koutecký, Jon Lee, Viswanath Nagarajan +1
We consider the max-cut and max--cut problems under graph-based constraints. Our approach can handle any constraint specified using monadic second-order (MSO) logic on graphs of…