3894 search results - page 45 / 779 » Approximation Algorithms for Biclustering Problems |
124
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
137
click to vote
SODA
2010
ACM
16 years 12 days ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
135
click to vote
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
139
click to vote
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We consider the two-dimensional bin packing and strip packing problem, where a list of rectangles has to be packed into a minimal number of rectangular bins or a strip of...
129
click to vote
ALGORITHMICA
2004
15 years 2 months ago
2004
We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...