On the Implementation of MST-based heuristics for the Steiner problem in graphs

In  Proceedings of the Fourth International Workshop on Algorithm Engineering and Experiments (ALENEX'02)

Publisher  Springer-Verlag

Details

TypeInproceedings
Pages1–15
Volume2409
SeriesLecture Notes in Computer Science
Share
Share this page on Facebook
Share this page on Twitter
Share this page on LinkedIn
E-mail this page
RSS feeds
> Publications > On the Implementation of MST-based heuristics for the Steiner problem in graphs