4894 search results - page 329 / 979 » The Guarding Problem - Complexity and Approximation |
189
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
211
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
170
click to vote
WSC
1998
15 years 8 months ago
1998
This paper explores the use of discrete-event simulation for the design and control of physical protection systems for fixed-site facilities housing items of significant value. It...
193
click to vote
TKDE
2010
15 years 5 months ago
2010
—With the popularity of voting systems in cyberspace, there are growing evidence that the current voting systems can be manipulated by fake votes. This problem has attracted many...
201
click to vote
LION
2009
Springer
16 years 1 months ago
2009
Springer
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a pra...