117 citations · 273 across the 35 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
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…
cs.CC2009★ 117 cited
Non-monotone submodular maximization under matroid and knapsack constraints
Jon Lee, Vahab Mirrokni, Viswanath Nagarjan +1
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hyp…