![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Calinescu G. Zelikovsky A.
Publisher: Springer Publishing Company
ISSN: 1382-6905
Source: Journal of Combinatorial Optimization, Vol.9, Iss.3, 2005-05, pp. : 281-294
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On Steiner Versions of (bi)Connectivity in Network Problems
Graphs and Combinatorics, Vol. 20, Iss. 2, 2004-06 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On reductions for the Steiner Problem in Graphs
By Kingston J.H. Sheppard N.P.
Journal of Discrete Algorithms, Vol. 1, Iss. 1, 2003-02 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
The Steiner connectivity problem
By Borndörfer Ralf Karbstein Marika Pfetsch Marc
Mathematical Programming, Vol. 142, Iss. 1-2, 2013-12 ,pp. :