604 search results - page 10 / 121 » On the Complexity of the Maximum Cut Problem |
ALGORITHMICA
2010
13 years 7 months ago
2010
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
JMLR
2006
13 years 7 months ago
2006
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
ICIG
2009
IEEE
14 years 2 months ago
2009
IEEE
Categorizing multiple objects in images is essentially a structured prediction problem: the label of an object is in general dependent on the labels of other objects in the image....
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
FSTTCS
2001
Springer
14 years 1 days ago
2001
Springer
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...