331 search results - page 17 / 67 » Approximation Algorithms for Connected Dominating Sets |
ICOIN
2004
Springer
15 years 5 months ago
2004
Springer
In a mobile ad hoc network (MANET), packet broadcast is common and frequently used to disseminate information. Broadcast consume large amount of bandwidth resource, which is scarce...
IPMU
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
100
click to vote
SIAMCOMP
1998
14 years 11 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
APPROX
2007
Springer
15 years 6 months 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 ...
207
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...