3894 search results - page 49 / 779 » Approximation Algorithms for Biclustering Problems |
171
click to vote
FOCS
2004
IEEE
15 years 9 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
173
click to vote
APPROX
2009
Springer
16 years 17 days ago
2009
Springer
We study several multi-criteria undirected network design problems with node costs and lengths. All these problems are related to the Multicommodity Buy at Bulk (MBB) problem in w...
181
click to vote
WADS
2007
Springer
16 years 2 days ago
2007
Springer
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
148
click to vote
FCT
2003
Springer
15 years 11 months ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
187
click to vote
ESA
2005
Springer
15 years 11 months ago
2005
Springer
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...