A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions

Thomas Bosman. A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions. In Evripidis Bampis, editor, Experimental Algorithms - 14th International Symposium, SEA 2015, Paris, France, June 29 - July 1, 2015, Proceedings. Volume 9125 of Lecture Notes in Computer Science, pages 391-402, Springer, 2015. [doi]

@inproceedings{Bosman15,
  title = {A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions},
  author = {Thomas Bosman},
  year = {2015},
  doi = {10.1007/978-3-319-20086-6_30},
  url = {http://dx.doi.org/10.1007/978-3-319-20086-6_30},
  researchr = {https://researchr.org/publication/Bosman15},
  cites = {0},
  citedby = {0},
  pages = {391-402},
  booktitle = {Experimental Algorithms - 14th International Symposium, SEA 2015, Paris, France, June 29 - July 1, 2015, Proceedings},
  editor = {Evripidis Bampis},
  volume = {9125},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-20085-9},
}