9 search results - page 2 / 2 » Combining a Memetic Algorithm with Integer Programming to So... |
STOC
2010
ACM
13 years 9 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
CPM
2005
Springer
13 years 10 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...
ICCAD
2002
IEEE
14 years 1 months ago
2002
IEEE
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduc...
WABI
2009
Springer
13 years 11 months ago
2009
Springer
Background: Supertree methods combine the phylogenetic information from multiple partially-overlapping trees into a larger phylogenetic tree called a supertree. Several supertree ...