Online social networks have become very popular in recent years and their number of users is already measured in many hundreds of millions. For various commercial and sociological...
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
(Appears as a regular paper in the Proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), Washington D.C, IEEE Computer Society, Nov. 2002, p...
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsen...