1554 search results - page 4 / 311 » Parameterized Complexity and Approximation Algorithms |
136
click to vote
RECOMB
2006
Springer
16 years 2 months ago
2006
Springer
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
131
click to vote
IWPEC
2004
Springer
15 years 7 months ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
103
click to vote
JDA
2006
15 years 2 months ago
2006
We consider the asymmetric traveling salesperson problem with -parameterized triangle inequality for [1/2, 1). That means, the edge weights fulfill w(u, v)
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with...
MFCS
2004
Springer
15 years 7 months ago
2004
Springer
