16404 search results - page 267 / 3281 » A set coverage problem |
188
click to vote
COCOON
2004
Springer
15 years 10 months ago
2004
Springer
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
136
click to vote
IJCAI
2003
15 years 5 months ago
2003
We investigate interchangeability of values in CSPs, based on an approach where a single value in the domain of a variable can be treated as a combination of “sub-values”. An ...
220
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
119
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
— In this paper we use partially ordered sets (posets) to study decentralized control problems arising in different settings. We show that time delayed systems with certain dela...
171
click to vote
KDD
2007
ACM
16 years 4 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...