3019 search results - page 44 / 604 » Approximating the Domatic Number |
123
click to vote
NIPS
2008
15 years 3 months ago
2008
Hierarchical probabilistic modeling of discrete data has emerged as a powerful tool for text analysis. Posterior inference in such models is intractable, and practitioners rely on...
116
click to vote
ICALP
1998
Springer
15 years 6 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
102
click to vote
FOCS
1998
IEEE
15 years 6 months ago
1998
IEEE
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
151
click to vote
SIAMCOMP
1998
15 years 1 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
133
click to vote
JAL
2006
15 years 1 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...