STOC
1994
ACM
13 years 7 months ago
1994
ACM
We indicate strong non-approximability factors for central problems: N1/4 for Max Clique; N1/10 for Chromatic Number; and 66/65 for Max 3SAT. Underlying the Max Clique result is a...
WG
2004
Springer
13 years 9 months ago
2004
Springer
We show how to use split decomposition to compute the weighted clique number and the chromatic number of a graph and we apply these results to some classes of graphs. In particular...
INFOCOM
2005
IEEE
13 years 10 months ago
2005
IEEE
Abstract— Given a wireless ad hoc network and an endto-end traffic pattern, the power rate function refers to the minimum total power required to support different throughput un...
FOCS
2006
IEEE
13 years 10 months ago
2006
IEEE
Given an n-element set U and a family of subsets S ⊆ 2U we show how to count the number of k-partitions S1 ∪ · · · ∪ Sk = U into subsets Si ∈ S in time 2nnO(1). The only...
IWOCA
2009
Springer
13 years 11 months ago
2009
Springer
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...