8 search results - page 1 / 2 » Approximating Dense Max 2-CSPs |
SODA
2008
ACM
13 years 8 months ago
2008
ACM
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
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
Many datasets can be described in the form of graphs or networks where nodes in the graph represent entities and edges represent relationships between pairs of entities. A common ...
ROBOCUP
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
DAM
2010
13 years 7 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...