Une heuristique pour le problème de l'arbre de Steiner

DOI10.1051/ro/1978120202071zbMath0379.90103OpenAlexW2586554544MaRDI QIDQ4158844

Choukhmane El-Arbi

Publication date: 1978

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/104689

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Mathematical programming (90C99)

Related Items

A primal-dual approximation algorithm for the Steiner forest problem, RNC-approximation algorithms for the steiner problem, Steiner problem in Halin networks, A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes, Path-distance heuristic for the Steiner problem in undirected networks, Heuristics for the Steiner problem in graphs, Survivable networks, linear programming relaxations and the parsimonious property, Steiner's problem in graphs: Heuristic methods, A near linear time approximation scheme for Steiner tree among obstacles in the plane, Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation, Worst-case performance of some heuristics for Steiner's problem in directed graphs