3894 search results - page 53 / 779 » Approximation Algorithms for Biclustering Problems |
171
click to vote
CCCG
2010
15 years 7 months ago
2010
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
139
click to vote
SODA
2000
ACM
15 years 7 months ago
2000
ACM
We consider the following two instances of the projective clustering problem: Given a set
180
click to vote
ESA
2001
Springer
15 years 10 months ago
2001
Springer
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
178
click to vote
NETWORKS
2006
15 years 6 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
191
click to vote
SODA
1992
ACM
15 years 7 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...