4894 search results - page 101 / 979 » The Guarding Problem - Complexity and Approximation |
172
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
188
click to vote
ISAAC
2005
Springer
16 years 6 days ago
2005
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
190
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
This paper presents a novel alternative approach, namely weakly supervised learning (WSL), to learn the pre-image of a feature vector in the feature space induced by a kernel. It ...
194
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We propose the use of rough sets theory to improve the first approximation provided by a multi-objective evolutionary algorithm and retain the nondominated solutions using a new ...
210
click to vote
SPAA
2004
ACM
16 years 3 days ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...