628 search results - page 51 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
130
click to vote
CPM
2005
Springer
15 years 8 months ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
110
click to vote
RTA
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
128
click to vote
BICOB
2009
Springer
15 years 9 months ago
2009
Springer
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
146
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
132
click to vote
ISAAC
2003
Springer
15 years 8 months ago
2003
Springer
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...