599 search results - page 75 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
138
click to vote
KDD
2010
ACM
15 years 1 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
133
click to vote
WWW
2010
ACM
15 years 10 months ago
2010
ACM
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
130
click to vote
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
FSTTCS
2008
Springer
15 years 4 months ago
2008
Springer
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
150
click to vote
WAOA
2005
Springer
15 years 8 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...