Packing Steiner trees: polyhedral investigations

1996 ◽  
Vol 72 (2) ◽  
pp. 101-123 ◽  
Author(s):  
M. Grötschel ◽  
A. Martin ◽  
R. Weismantel
Keyword(s):  
Steiner Trees

Optimal Steiner trees under node and edge privacy conflicts

2021 ◽  
Author(s):  
Alessandro Hill ◽  
Roberto Baldacci ◽  
Stefan Voß
Keyword(s):  
Steiner Trees

scholarly journals Connected perimeter of planar sets

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
François Dayrens ◽  
Simon Masnou ◽  
Matteo Novaga ◽  
Marco Pozzetta
Keyword(s):  
Minimization Problem ◽  
Existence Of Solutions ◽  
Lower Semicontinuous ◽  
Representation Formula ◽  
Steiner Trees ◽  
Lower Semicontinuous Envelope ◽  
Simply Connected

AbstractWe introduce a notion of connected perimeter for planar sets defined as the lower semicontinuous envelope of perimeters of approximating sets which are measure-theoretically connected. A companion notion of simply connected perimeter is also studied. We prove a representation formula which links the connected perimeter, the classical perimeter, and the length of suitable Steiner trees. We also discuss the application of this notion to the existence of solutions to a nonlocal minimization problem with connectedness constraint.

A note on lower bounds for rectilinear Steiner trees

1992 ◽  
Vol 42 (3) ◽  
pp. 151-152
Author(s):  
J.S. Salowe
Keyword(s):  
Lower Bounds ◽  
Steiner Trees

scholarly journals Finding Steiner trees with degree 1 terminal nodes

2004 ◽  
Vol 1 (9) ◽  
pp. 258-262
Author(s):  
Hector Cancela ◽  
Franco Robledo ◽  
Gerardo Rubino
Keyword(s):  
Steiner Trees

Directed Steiner trees with diffusion costs

2015 ◽  
Vol 32 (4) ◽  
pp. 1089-1106 ◽  
Author(s):  
Dimitri Watel ◽  
Marc-Antoine Weisser ◽  
Cédric Bentz ◽  
Dominique Barth
Keyword(s):  
Steiner Trees

A new heuristic for rectilinear Steiner trees

2002 ◽  
Author(s):  
R. Condamoor ◽  
I.G. Tollis
Keyword(s):  
Steiner Trees

On Steiner trees for bounded point sets

1981 ◽  
Vol 11 (3) ◽  
Author(s):  
F.R.K. Chung ◽  
R.L. Graham
Keyword(s):  
Steiner Trees ◽  
Point Sets

Faster exact algorithms for steiner trees in planar networks

Networks ◽  
1990 ◽  
Vol 20 (1) ◽  
pp. 109-120 ◽  
Author(s):  
Marshall Bern
Keyword(s):  
Exact Algorithms ◽  
Steiner Trees ◽  
Planar Networks

STEINER TREES, STEINER CIRCUITS AND THE INTERFERENCE PROBLEM IN BUILDING DESIGN

1979 ◽  
Vol 4 (1) ◽  
pp. 15-36 ◽  
Author(s):  
J. MACGREGOR SMITH ◽  
JUDITH S. LIEBMAN
Keyword(s):  
Building Design ◽  
Steiner Trees

The Generalized Connectivity of Generalized Petersen Graph

2021 ◽  
Author(s):  
Yuan Si ◽  
Ping Li ◽  
Yuzhi Xiao ◽  
Jinxia Liang
Keyword(s):  
Steiner Trees ◽  
Petersen Graph ◽  
Generalized Petersen Graph ◽  
Edge Disjoint ◽  
Generalized Connectivity ◽  
Vertex Set

For a vertex set [Formula: see text] of [Formula: see text], we use [Formula: see text] to denote the maximum number of edge-disjoint Steiner trees of [Formula: see text] such that any two of such trees intersect in [Formula: see text]. The generalized [Formula: see text]-connectivity of [Formula: see text] is defined as [Formula: see text]. We get that for any generalized Petersen graph [Formula: see text] with [Formula: see text], [Formula: see text] when [Formula: see text]. We give the values of [Formula: see text] for Petersen graph [Formula: see text], where [Formula: see text], and the values of [Formula: see text] for generalized Petersen graph [Formula: see text], where [Formula: see text] and [Formula: see text].

Sign in / Sign up

Export Citation Format

Share Document