Trees of Shortest Paths vs. Steiner Trees: Understanding and Improving Delete Relaxation Heuristics

Emil Keyder, Hector Geffner. Trees of Shortest Paths vs. Steiner Trees: Understanding and Improving Delete Relaxation Heuristics. In Craig Boutilier, editor, IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009. pages 1734-1739, 2009. [doi]

@inproceedings{KeyderG09,
  title = {Trees of Shortest Paths vs. Steiner Trees: Understanding and Improving Delete Relaxation Heuristics},
  author = {Emil Keyder and Hector Geffner},
  year = {2009},
  url = {http://ijcai.org/papers09/Papers/IJCAI09-289.pdf},
  researchr = {https://researchr.org/publication/KeyderG09},
  cites = {0},
  citedby = {0},
  pages = {1734-1739},
  booktitle = {IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009},
  editor = {Craig Boutilier},
}