Free Access
| Issue |
RAIRO-Oper. Res.
Volume 12, Number 2, 1978
|
|
|---|---|---|
| Page(s) | 207 - 212 | |
| DOI | https://doi.org/10.1051/ro/1978120202071 | |
| Published online | 06 February 2017 | |
- 1. M. CHEIN, Un algorithme pour relier N Point, Calcolo, Fasc. 4, vol. 5, 1968p. 537-547. [Zbl: 0195.54304] [Google Scholar]
- 2. S. E. DREYFUS, The Steiner Problem in Graphs,, Networks, vol. 1, n° 3, 1972, p. 195-207. [MR: 297107] [Zbl: 0229.05125] [Google Scholar]
- 3. R. M. KARP, The Fast Approximation Solution of Hard Problems, Proc. 6th S.E. Conf. Combinatorics Graphs Theory and Computing, 1975, p. 15-51. [MR: 403309] [Zbl: 0369.05049] [Google Scholar]
- 4. R. M. KARP, Reductibility Among Combinatorial Problems, Complexity of Computer Computations, R. E. MILLER and J. W. THATCHER, eds., Plenum Press, New York, 1972, p. 85-104. [MR: 378476] [Zbl: 0366.68041] [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.