3894 search results - page 169 / 779 » Approximation Algorithms for Biclustering Problems |
165
click to vote
INFOCOM
2005
IEEE
16 years 2 days ago
2005
IEEE
— The problem Min-Power k-Connectivity seeks a power assignment to the nodes in a given wireless ad hoc network such that the produced network topology is k-connected and the tot...
203
click to vote
AAAI
2000
15 years 7 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
193
click to vote
DCOSS
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
150
click to vote
IPCO
1996
15 years 7 months ago
1996
In recent years, approximation algorithms based on randomized rounding of fractional optimal solutions have been applied to several classes of discrete optimization problems. In t...
145
click to vote
CPM
2004
Springer
15 years 12 months ago
2004
Springer
Given two undirected trees T and P, the Subtree Homeomorphism Problem is to find whether T has a subtree t that can be transformed into P by removing entire subtrees, as well as ...