Trees of Shortest Paths vs. Steiner Trees: Understanding and Improving Delete Relaxation Heuristics. Keyder, E. & Geffner, H. In IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009, pages 1734–1739, 2009.
Paper bibtex @inproceedings{DBLP:conf/ijcai/KeyderG09,
author = {Emil Keyder and
Hector Geffner},
editor = {Craig Boutilier},
title = {Trees of Shortest Paths vs. Steiner Trees: Understanding and Improving
Delete Relaxation Heuristics},
booktitle = {{IJCAI} 2009, Proceedings of the 21st International Joint Conference
on Artificial Intelligence, Pasadena, California, USA, July 11-17,
2009},
pages = {1734--1739},
year = {2009},
url = {http://ijcai.org/Proceedings/09/Papers/289.pdf},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/KeyderG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0
{"_id":"GgKj5mEka7xyX2XrZ","bibbaseid":"keyder-geffner-treesofshortestpathsvssteinertreesunderstandingandimprovingdeleterelaxationheuristics-2009","downloads":0,"creationDate":"2015-01-21T18:04:23.208Z","title":"Trees of Shortest Paths vs. Steiner Trees: Understanding and Improving Delete Relaxation Heuristics","author_short":["Keyder, E.","Geffner, H."],"year":2009,"bibtype":"inproceedings","biburl":"https://ml.rwth-aachen.de//publications.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Emil"],"propositions":[],"lastnames":["Keyder"],"suffixes":[]},{"firstnames":["Hector"],"propositions":[],"lastnames":["Geffner"],"suffixes":[]}],"editor":[{"firstnames":["Craig"],"propositions":[],"lastnames":["Boutilier"],"suffixes":[]}],"title":"Trees of Shortest Paths vs. Steiner Trees: Understanding and Improving Delete Relaxation Heuristics","booktitle":"IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009","pages":"1734–1739","year":"2009","url":"http://ijcai.org/Proceedings/09/Papers/289.pdf","timestamp":"Tue, 20 Aug 2019 01:00:00 +0200","biburl":"https://dblp.org/rec/conf/ijcai/KeyderG09.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/ijcai/KeyderG09,\n author = {Emil Keyder and\n Hector Geffner},\n editor = {Craig Boutilier},\n title = {Trees of Shortest Paths vs. Steiner Trees: Understanding and Improving\n Delete Relaxation Heuristics},\n booktitle = {{IJCAI} 2009, Proceedings of the 21st International Joint Conference\n on Artificial Intelligence, Pasadena, California, USA, July 11-17,\n 2009},\n pages = {1734--1739},\n year = {2009},\n url = {http://ijcai.org/Proceedings/09/Papers/289.pdf},\n timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/ijcai/KeyderG09.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Keyder, E.","Geffner, H."],"editor_short":["Boutilier, C."],"key":"DBLP:conf/ijcai/KeyderG09","id":"DBLP:conf/ijcai/KeyderG09","bibbaseid":"keyder-geffner-treesofshortestpathsvssteinertreesunderstandingandimprovingdeleterelaxationheuristics-2009","role":"author","urls":{"Paper":"http://ijcai.org/Proceedings/09/Papers/289.pdf"},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"search_terms":["trees","shortest","paths","steiner","trees","understanding","improving","delete","relaxation","heuristics","keyder","geffner"],"keywords":[],"authorIDs":[],"dataSources":["oobJ8X29PJDnZ5HfE","NPkLw45kG9GWYL49R","tubGENBygCFYfB7TL","4HkuWzYuAg2ZviM2X","bTnDYS5vwPW5Supsu","tf5mTExTEFXuErEdH","45WxtJyDz9zx6pdDx","5q9jKxssadh8cFBKs","6fZkG8tXqBebfLw5Y","waHGWjpvXXx3AyHy9","6adukg4graHyCHEMo","BMmm68taAyypDfPH2","ovz3PTw8JN5vXb8uW","bpX5w62ubdK9Lh4gm","GCNA4EFhYoAKgp6xx","4yFfvDeKJAumYHnKt","X5ov3ErvGdauPhZ46","FfFCCjRd3JRTRveEW","YEQd6v4xr5ntvjRqm"]}