3894 search results - page 71 / 779 » Approximation Algorithms for Biclustering Problems |
171
click to vote
TAMC
2009
Springer
16 years 21 days ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
184
click to vote
FOCS
2007
IEEE
16 years 15 days ago
2007
IEEE
We consider a variant of the classic multi-armed bandit problem (MAB), which we call FEEDBACK MAB, where the reward obtained by playing each of n independent arms varies according...
172
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
166
click to vote
JAL
2006
15 years 6 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
218
click to vote
ESA
2011
Springer
14 years 5 months ago
2011
Springer
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...