701 search results - page 37 / 141 » An Ant Algorithm for the Steiner Tree Problem in Graphs |
ICCAD
1994
IEEE
13 years 11 months ago
1994
IEEE
We study a new placement problem: the reproducing placement problem (RPP). In each phase a module (or gate) is decomposed into two (or more) simpler modules. The goal is nd a \go...
COCOC
1995
13 years 11 months ago
1995
We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree o...
TSMC
2010
13 years 2 months ago
2010
Abstract--The multimode resource-constrained projectscheduling problem with discounted cash flows (MRCPSPDCF) is important and challenging for project management. As the problem is...
ESOP
2009
Springer
13 years 11 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
IWPEC
2009
Springer
14 years 2 months ago
2009
Springer
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...