The complexity of scheduling trees with communication delays (Extended abstract)

J.K. Lenstra; M. Veldhorst; B. Veltman

doi:10.1007/3-540-57273-2_63

The complexity of scheduling trees with communication delays (Extended abstract)

J.K. Lenstra, M. Veldhorst, B. Veltman

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Original language	English
Title of host publication	Algorithms - ESA'93 (Proceedings of the First Annual European Symposium, Bad Honnef, Germany, September 30-October 2, 1993)
Editors	T. Lengauer
Publisher	Springer
Pages	284-294
ISBN (Print)	3-540-57273-2
DOIs	https://doi.org/10.1007/3-540-57273-2_63
Publication status	Published - 1993

Publication series

Name	Lecture Notes in Computer Science
Volume	726
ISSN (Print)	0302-9743

Access to Document

10.1007/3-540-57273-2_63

Cite this

Lenstra, J. K., Veldhorst, M., & Veltman, B. (1993). The complexity of scheduling trees with communication delays (Extended abstract). In T. Lengauer (Ed.), Algorithms - ESA'93 (Proceedings of the First Annual European Symposium, Bad Honnef, Germany, September 30-October 2, 1993) (pp. 284-294). (Lecture Notes in Computer Science; Vol. 726). Springer. https://doi.org/10.1007/3-540-57273-2_63

@inproceedings{fabc66e8a3724c94b5ae3fc869a4a519,

title = "The complexity of scheduling trees with communication delays (Extended abstract)",

author = "J.K. Lenstra and M. Veldhorst and B. Veltman",

year = "1993",

doi = "10.1007/3-540-57273-2\_63",

language = "English",

isbn = "3-540-57273-2",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "284--294",

editor = "T. Lengauer",

booktitle = "Algorithms - ESA'93 (Proceedings of the First Annual European Symposium, Bad Honnef, Germany, September 30-October 2, 1993)",

address = "Germany",

}

Lenstra, JK, Veldhorst, M & Veltman, B 1993, The complexity of scheduling trees with communication delays (Extended abstract). in T Lengauer (ed.), Algorithms - ESA'93 (Proceedings of the First Annual European Symposium, Bad Honnef, Germany, September 30-October 2, 1993). Lecture Notes in Computer Science, vol. 726, Springer, pp. 284-294. https://doi.org/10.1007/3-540-57273-2_63

The complexity of scheduling trees with communication delays (Extended abstract). / Lenstra, J.K.; Veldhorst, M.; Veltman, B.
Algorithms - ESA'93 (Proceedings of the First Annual European Symposium, Bad Honnef, Germany, September 30-October 2, 1993). ed. / T. Lengauer. Springer, 1993. p. 284-294 (Lecture Notes in Computer Science; Vol. 726).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - The complexity of scheduling trees with communication delays (Extended abstract)

AU - Lenstra, J.K.

AU - Veldhorst, M.

AU - Veltman, B.

PY - 1993

Y1 - 1993

U2 - 10.1007/3-540-57273-2_63

DO - 10.1007/3-540-57273-2_63

M3 - Conference contribution

SN - 3-540-57273-2

T3 - Lecture Notes in Computer Science

SP - 284

EP - 294

BT - Algorithms - ESA'93 (Proceedings of the First Annual European Symposium, Bad Honnef, Germany, September 30-October 2, 1993)

A2 - Lengauer, T.

PB - Springer

ER -