714 search results - page 139 / 143 » Lexicographically-ordered constraint satisfaction problems |
FOCS
2008
IEEE
14 years 4 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:...
CP
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
WISEC
2009
ACM
14 years 4 months ago
2009
ACM
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Recent work has shown how information theory extends conventional full-rationality game theory to allow bounded rational agents. The associated mathematical framework can be used ...
FOCS
2007
IEEE
14 years 4 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...