4894 search results - page 333 / 979 » The Guarding Problem - Complexity and Approximation |
198
click to vote
SIAMJO
2002
15 years 6 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
187
click to vote
ICDT
2005
ACM
16 years 6 days ago
2005
ACM
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
175
click to vote
IPSN
2005
Springer
16 years 6 days ago
2005
Springer
We address the problem of selecting sensors so as to minimize the error in estimating the position of a target. We consider a generic sensor model where the measurements can be in...
201
click to vote
SAC
2003
ACM
15 years 12 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
162
click to vote
TIP
1998
15 years 6 months ago
1998
This paper examines the relationship between wavelet-based image processing algorithms and variational problems. Algorithms are derived as exact or approximate minimizers of varia...