A partition-based heuristic for the Steiner tree problem in large graphs

Published in HM 2014, Volume 8457 of Lecture Notes in Computer Science, pp. 56-70, 2014

View paper here

Download paper here

Bibtex:

@inproceedings{DBLP:conf/hm/LeitnerLLR14,
  author    = {Markus Leitner and
               Ivana Ljubic and
               Martin Luipersbeck and
               Max Resch},
  editor    = {Maria J. Blesa and
               Christian Blum and
               Stefan Vo{\ss}},
  title     = {A Partition-Based Heuristic for the Steiner Tree Problem in Large
               Graphs},
  booktitle = {Hybrid Metaheuristics - 9th International Workshop, {HM} 2014, Hamburg,
               Germany, June 11-13, 2014. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {8457},
  pages     = {56--70},
  publisher = {Springer},
  year      = {2014},
  url       = {https://doi.org/10.1007/978-3-319-07644-7\_5},
  doi       = {10.1007/978-3-319-07644-7\_5},
  timestamp = {Sun, 02 Oct 2022 16:02:33 +0200},
  biburl    = {https://dblp.org/rec/conf/hm/LeitnerLLR14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}