237 search results - page 5 / 48 » Improved Approximations of Independent Sets in Bounded-Degre... |
DCOSS
2008
Springer
13 years 9 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
ESA
2001
Springer
14 years 1 days ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
JGT
2007
13 years 7 months ago
2007
A graph is uniquely hamiltonian if it contains exactly one hamiltonian cycle. In this note we prove that there are no r-regular uniquely hamiltonian graphs when r > 22. This im...
APPROX
2005
Springer
14 years 1 months ago
2005
Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...