628 search results - page 48 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
160
click to vote
COR
2008
15 years 1 months ago
2008
In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for...
119
click to vote
JCSS
2010
15 years 1 months ago
2010
A subgraph T of a digraph D is an out-branching if T is an oriented spanning tree with only one vertex of in-degree zero (called the root). The vertices of T of out-degree zero ar...
108
click to vote
GBRPR
2007
Springer
15 years 9 months ago
2007
Springer
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
128
click to vote
EOR
2008
15 years 3 months ago
2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
136
click to vote
RECOMB
2010
Springer
15 years 1 months ago
2010
Springer
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...