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

• Type: Conference
• Year: 2008
• Where: SODA
• Authors: Claire Mathieu, Warren Schudy
• Keywords: Algorithms, Approximation Schemes, Dense Instances, SODA 2008, Sophisticated Approximation Schemes