3894 search results - page 146 / 779 » Approximation Algorithms for Biclustering Problems |
137
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
165
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
163
click to vote
ECCC
2000
15 years 6 months ago
2000
We design a 0:795 approximation algorithm for the Max-Bisection problem restricted to regular graphs. In the case of three regular graphs our results imply an approximation ratio ...
162
click to vote
SSS
2009
Springer
16 years 29 days ago
2009
Springer
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
182
click to vote
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specificall...