Une heuristique pour le problème de l'arbre de Steiner
RAIRO - Operations Research - Recherche Opérationnelle (1978)
- Volume: 12, Issue: 2, page 207-212
- ISSN: 0399-0559
Access Full Article
topHow to cite
topReferences
top- 1. M. CHEIN, Un algorithme pour relier N Point, Calcolo, Fasc. 4, vol. 5, 1968p. 537-547. Zbl0195.54304
- 2. S. E. DREYFUS, The Steiner Problem in Graphs,, Networks, vol. 1, n° 3, 1972, p. 195-207. Zbl0229.05125MR297107
- 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. Zbl0369.05049MR403309
- 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. Zbl0366.68041MR378476