8 citations · 11 across the 5 of their papers we have counts for
1 paper · 1 filter
Jon Lee, Viswanath Nagarajan, Xiangkun Shen
An instance of the graph-constrained max-cut (GCMC) problem consists of (i) an undirected graph G and (ii) edge-weights on a complete undirected graph on the same vertex set. The o…