500 search results - page 21 / 100 » Approximation algorithms for maximum independent set of pseu... |
166
click to vote
APPROX
2007
Springer
16 years 25 days ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
127
click to vote
CCCG
2010
15 years 8 months ago
2010
We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising ...
151
click to vote
VLDB
2005
ACM
16 years 4 days ago
2005
ACM
We study the problem of computing waveletbased synopses for massive data sets in static and streaming environments. A compact representation of a data set is obtained after a thre...
155
click to vote
IJCAI
1989
15 years 7 months ago
1989
Nilsson's Probabilistic Logic is a set theoretic mechanism for reasoning with uncertainty. We propose a new way of looking at the probability constraints enforced by the fram...
164
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...