On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs

Marcus Poggi de Aragão, Renato Fonseca F. Werneck. On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs. In David M. Mount, Clifford Stein, editors, Algorithm Engineering and Experiments, 4th International Workshop, ALENEX 2002, San Francicsco, CA, USA, January 4-5, 2002, Revised Papers. Volume 2409 of Lecture Notes in Computer Science, pages 1-15, Springer, 2002. [doi]

@inproceedings{AragaoW02,
  title = {On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs},
  author = {Marcus Poggi de Aragão and Renato Fonseca F. Werneck},
  year = {2002},
  url = {http://link.springer.de/link/service/series/0558/bibs/2409/24090001.htm},
  tags = {rule-based, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/AragaoW02},
  cites = {0},
  citedby = {0},
  pages = {1-15},
  booktitle = {Algorithm Engineering and Experiments, 4th International Workshop, ALENEX 2002, San Francicsco, CA, USA, January 4-5, 2002, Revised Papers},
  editor = {David M. Mount and Clifford Stein},
  volume = {2409},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-43977-3},
}