1158 search results - page 91 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
186
click to vote
WAOA
2005
Springer
15 years 11 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
182
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
153
click to vote
WEA
2005
Springer
15 years 11 months ago
2005
Springer
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
160
click to vote
DAGSTUHL
2007
2007
Nonsymmetric algebraic Riccati equations associated with an M-matrix: recent advances and algorithms
15 years 7 months ago
We survey on theoretical properties and algorithms concerning the problem of solving a nonsymmetric algebraic Riccati equation, and we report on some known methods and new algorit...
275
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...