Jan Karel Lenstra, Marinus Veldhorst. The Complexity of Scheduling Trees with Communication Delays (Extended Abstract). In Thomas Lengauer, editor, Algorithms - ESA 93, First Annual European Symposium, Bad Honnef, Germany, September 30 - October 2, 1993, Proceedings. Volume 726 of Lecture Notes in Computer Science, pages 284-294, Springer, 1993.
@inproceedings{LenstraV93,
title = {The Complexity of Scheduling Trees with Communication Delays (Extended Abstract)},
author = {Jan Karel Lenstra and Marinus Veldhorst},
year = {1993},
researchr = {https://researchr.org/publication/LenstraV93},
cites = {0},
citedby = {0},
pages = {284-294},
booktitle = {Algorithms - ESA 93, First Annual European Symposium, Bad Honnef, Germany, September 30 - October 2, 1993, Proceedings},
editor = {Thomas Lengauer},
volume = {726},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-57273-2},
}