scientific article; zbMATH DE number 4008433

MaRDI QIDQ3758867zbMATH OpenFDO

Authors Stefan Voß, Klaus Dieter Mehr

Publication date 1987

zbMATH Keywords

heuristic algorithmgeneralized Steiner problemminimum cost 2-edge- connected subgraph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Extremal problems in graph theory (05C35)

Recommendations

• On the structure and complexity of the 2-connected Steiner network problem in the plane
• Some generalizations of the steiner problem in graphs
• On Steiner 2-edge connected polytopes
• On the Steiner 2-edge connected subgraph polytope
• A factor 2 approximation algorithm for the generalized Steiner network problem
• Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane
• Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs
• scientific article; zbMATH DE number 1182759
• Strong Formulations for 2-Node-Connected Steiner Network Problems
• Generalized Steiner problem in outerplanar networks

Cited in

(6)

• A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
• 2-connected and 2-edge-connected Steinhaus graphs
• On Steiner 2-edge connected polytopes
• On Steiner versions of (bi)connectivity in network problems
• On the dominant of the Steiner 2-edge connected subgraph polytope
• The bottleneck 2-connected k-Steiner network problem for k 2

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3758867)