1090 search results - page 72 / 218 » Priority Algorithms for Graph Optimization Problems |
ADHOCNOW
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In focused coverage problem, sensors are required to be deployed around a given point of interest (POI) with respect to a priority requirement: an area close to POI has h...
CP
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
JMLR
2010
13 years 5 months ago
2010
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
ALGORITHMICA
1998
13 years 10 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
PAMI
2007
13 years 9 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....