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

DOI10.1051/RO/1978120202071MaRDI QIDQ4158844zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(11)

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

This page was built for publication: Une heuristique pour le problème de l'arbre de Steiner

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