Sciweavers

613 search results - page 14 / 123
» The Model-Summary Problem and a Solution for Trees
Sort
View
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
14 years 4 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
SIAMDM
2010
113views more  SIAMDM 2010»
13 years 1 months ago
The VPN Problem with Concave Costs
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
Samuel Fiorini, Gianpaolo Oriolo, Laura Sanit&agra...
JAIR
2008
94views more  JAIR 2008»
13 years 6 months ago
The Ultrametric Constraint and its Application to Phylogenetics
A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phyl...
Neil C. A. Moore, Patrick Prosser
AI
2006
Springer
13 years 6 months ago
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Sharlee Climer, Weixiong Zhang
JAIR
2007
106views more  JAIR 2007»
13 years 6 months ago
Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel constructive search technique that performs a series of resource-limited tree searches where each search begins...
J. Christopher Beck