26 search results - page 1 / 6 » approx 2004 |
APPROX
2004
Springer
13 years 10 months ago
2004
Springer
APPROX
2004
Springer
13 years 10 months ago
2004
Springer
Given any integer d ≥ 3, let k be the smallest integer such that d < 2k log k. We prove that with high probability the chromatic number of a random d-regular graph is k, k + 1...
APPROX
2004
Springer
13 years 10 months ago
2004
Springer
We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (mi...
APPROX
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
APPROX
2004
Springer
13 years 10 months ago
2004
Springer
We study the problem of minimizing the broadcast time for a set of processors in a cluster, where processor has transmission time , which is the time taken to send a message to any...