16404 search results - page 830 / 3281 » A set coverage problem |
205
click to vote
MP
2006
15 years 7 months ago
2006
Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [8,12] and claw-free graphs [7,8]...
226
click to vote
GRID
2007
Springer
15 years 7 months ago
2007
Springer
In the facility location problem (FLP) we are given a set of facilities and a set of clients, each of which is to be served by one facility. The goal is to decide which subset of f...
201
click to vote
KAIS
2000
15 years 7 months ago
2000
When data sets are analyzed, statistical pattern recognition is often used to find the information hidden in the data. Another approach to information discovery is data mining. Dat...
190
click to vote
TIT
1998
15 years 7 months ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
186
click to vote
PVLDB
2010
15 years 6 months ago
2010
Several database areas such as data exchange and integration share the problem of fixing database instance violations with respect to a set of constraints. The chase algorithm so...