1389 search results - page 109 / 278 » Improved Approximation Algorithms for Label Cover Problems |
135
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: In many microarray experiments, analysis is severely hindered by a major difficulty: the small number of samples for which expression data has been measured. When one ...
137
click to vote
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
128
click to vote
EOR
2008
15 years 3 months ago
2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
286
click to vote
AAIM
2011
Springer
14 years 6 months ago
2011
Springer
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...
121
Voted
STOC
2009
ACM
16 years 3 months ago
2009
ACM
We show how to compute the edit distance between two strings of length n up to a factor of 2 ~O( log n) in n1+o(1) time. This is the first sub-polynomial approximation algorithm f...