1158 search results - page 28 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
122
click to vote
ESA
2011
Springer
13 years 10 months ago
2011
Springer
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
114
click to vote
FOCS
1998
IEEE
15 years 3 months ago
1998
IEEE
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different ap...
DAC
1996
ACM
15 years 3 months ago
1996
ACM
Approximation has been shown to be an eective method for reducing the time and space costs of solving various oorplan area minimization problems. In this paper, we present several...
STOC
2009
ACM
15 years 11 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
FOCS
2008
IEEE
15 years 5 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...