3875 search results - page 686 / 775 » Approximation Algorithms for the Max-coloring Problem |
FOCS
2000
IEEE
14 years 4 days ago
2000
IEEE
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
SMA
2009
ACM
14 years 2 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
—Since the provision of both unicast and multicast services is expected for the next generation of multi-carrier wireless systems, the allocation of resources for this combinatio...
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
The largest databases in use today are so large that answering a query exactly can take minutes, hours, or even days. One way to address this problem is to make use of approximati...
FOCS
2002
IEEE
14 years 21 days ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....