274 search results - page 8 / 55 » The Polymatroid Steiner Problems |
JCT
2008
13 years 10 months ago
2008
If a Steiner system S(4, 5, 17) exists, it would contain derived S(3, 4, 16) designs. By relying on a recent classification of the S(3, 4, 16), an exhaustive computer search for S...
FOCS
2004
IEEE
14 years 2 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
ICDE
2009
IEEE
15 years 18 days ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
ICALP
2009
Springer
14 years 11 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
LATIN
2010
Springer
14 years 4 months ago
2010
Springer
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...