50 search results - page 7 / 10 » On the Strong Chromatic Number of Random Graphs |
142
click to vote
IWOCA
2009
Springer
16 years 9 days ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
163
click to vote
WEA
2005
Springer
15 years 11 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
167
click to vote
INFOCOM
2009
IEEE
16 years 12 days ago
2009
IEEE
—We consider the question of obtaining tight delay guarantees for throughout-optimal link scheduling in arbitrary topology wireless ad-hoc networks. We consider two classes of sc...
167
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
141
Voted
STOC
2009
ACM
16 years 6 months ago
2009
ACM
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...