632 search results - page 47 / 127 » On the Approximability of the Steiner Tree Problem |
ISPD
1999
ACM
15 years 4 months ago
1999
ACM
The presence of fixed terminals in hypergraph partitioning instances arising in top-down standard-cell placement makes such instances qualitatively different from the free hyperg...
IPL
1998
14 years 11 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
Given a set of leaf-labelled trees with identical leaf sets, the well-known MAST problem consists of finding a subtree homeomorphically included in all input trees and with the la...
101
click to vote
JCO
2007
14 years 11 months ago
2007
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
108
click to vote
TAMC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...