Sciweavers

IANDC
2007
123views more  IANDC 2007»
13 years 11 months ago
Hardness of fully dense problems
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
Nir Ailon, Noga Alon
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
14 years 27 days 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