3894 search results - page 271 / 779 » Approximation Algorithms for Biclustering Problems |
233
click to vote
WG
2004
Springer
15 years 12 months ago
2004
Springer
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
184
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
176
click to vote
BICOB
2009
Springer
16 years 1 months ago
2009
Springer
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
153
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
177
click to vote
TALG
2010
15 years 5 months ago
2010
We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the...