Sciweavers

Share
SODA
2008
ACM

Yet another algorithm for dense max cut: go greedy

8 years 3 months ago
Yet another algorithm for dense max cut: go greedy
We study dense instances of MaxCut and its generalizations. Following a long list of existing, diverse and often sophisticated approximation schemes, we propose taking the na
Claire Mathieu, Warren Schudy
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2008
Where SODA
Authors Claire Mathieu, Warren Schudy
Comments (0)
books