Udo Hönig, Wolfram Schiffmann. A Parallel Branch-and-Bound Algorithm for Computing Optimal Task Graph Schedules. In Minglu Li, Xian-He Sun, Qianni Deng, Jun Ni, editors, Grid and Cooperative Computing, Second International Workshop, GCC 2003, Shanghai, China, December 7-10, 2003, Revised Papers, Part II. Volume 3033 of Lecture Notes in Computer Science, pages 18-25, Springer, 2003. [doi]
@inproceedings{HonigS03,
title = {A Parallel Branch-and-Bound Algorithm for Computing Optimal Task Graph Schedules},
author = {Udo Hönig and Wolfram Schiffmann},
year = {2003},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3033&spage=18},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/HonigS03},
cites = {0},
citedby = {0},
pages = {18-25},
booktitle = {Grid and Cooperative Computing, Second International Workshop, GCC 2003, Shanghai, China, December 7-10, 2003, Revised Papers, Part II},
editor = {Minglu Li and Xian-He Sun and Qianni Deng and Jun Ni},
volume = {3033},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-21993-5},
}