1671 search results - page 63 / 335 » On the Covering Steiner Problem |
114
click to vote
KI
2007
Springer
15 years 6 months ago
2007
Springer
We introduce a novel stochastic local search algorithm for the vertex cover problem. Compared to current exhaustive search techniques, our algorithm achieves excellent performance ...
102
click to vote
CORR
2008
Springer
15 years 23 days ago
2008
Springer
Suppose we are given a finite set of points P in R3 and a collection of polytopes T that are all translates of the same polytope T. We consider two problems in this paper. The firs...
98
Voted
IPCO
2010
15 years 2 months ago
2010
In a column-restricted covering integer program (CCIP), all the non-zero entries of any column of the constraint matrix are equal. Such programs capture capacitated versions of cov...
ICDCS
1998
IEEE
15 years 5 months ago
1998
IEEE
This paper considers the problem of key agreement in a group setting with highly-dynamic group member population. A protocol suite, called CLIQUES, is developed by extending the w...
108
click to vote
INFOCOM
1995
IEEE
15 years 4 months ago
1995
IEEE
Establishing a multicast tree in a point-to-point network of switch nodes, such as a wide-area ATM network, is often modeled as the NP-complete Steiner problem in networks. In thi...