16404 search results - page 180 / 3281 » A set coverage problem |
229
click to vote
FSTTCS
2010
Springer
15 years 5 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
192
Voted
ISCIS
2003
Springer
16 years 4 days ago
2003
Springer
In this paper, we study an adaptive random search method based on continuous action-set learning automaton for solving stochastic optimization problems in which only the noisecorr...
239
Voted
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
Linear matrix Inequalities (LMIs) have had a major impact on control but formulating a problem as an LMI is an art. Recently there is the beginnings of a theory of which problems ...
160
click to vote
PKC
2010
Springer
15 years 9 months ago
2010
Springer
We revisit the problem of constructing efficient secure two-party protocols for the problems of setintersection and set-union, focusing on the model of malicious parties. Our main...
137
Voted
IPL
2006
15 years 7 months ago
2006
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...