1158 search results - page 55 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
147
click to vote
ISAAC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
152
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
135
Voted
ALGORITHMICA
1999
15 years 4 months ago
1999
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
161
Voted
DCOSS
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
156
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...