721 search results - page 93 / 145 » Bounds on the k-domination number of a graph |
APPROX
2004
Springer
15 years 5 months ago
2004
Springer
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an ex...
DMIN
2006
15 years 1 months ago
2006
- Clustering of data is an important data mining application. One of the problems with traditional partitioning clustering methods is that they partition the data into hard bound n...
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
104
click to vote
STOC
2006
ACM
16 years 4 days ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
101
click to vote
TKDE
2008
14 years 11 months ago
2008
Correlation mining has gained great success in many application domains for its ability to capture underlying dependencies between objects. However, research on correlation mining ...