Bitte melden Sie sich an um selbst Rezensionen oder Kommentare zu erstellen.
Zitieren Sie diese Publikation
Mehr Zitationsstile
- bitte auswählen -
%0 Journal Article
%1 journals/jal/LenstraVV96
%A Lenstra, Jan Karel
%A Veldhorst, Marinus
%A Veltman, Bart
%D 1996
%J J. Algorithms
%K dblp
%N 1
%P 157-173
%T The Complexity of Scheduling Trees with Communication Delays.
%U http://dblp.uni-trier.de/db/journals/jal/jal20.html#LenstraVV96
%V 20
@article{journals/jal/LenstraVV96,
added-at = {2011-07-01T00:00:00.000+0200},
author = {Lenstra, Jan Karel and Veldhorst, Marinus and Veltman, Bart},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2f2908a932718e7f303871ab1cc6011ae/dblp},
ee = {http://dx.doi.org/10.1006/jagm.1996.0007},
interhash = {e15402da369d924a3d5e2f5fc0ad1e50},
intrahash = {f2908a932718e7f303871ab1cc6011ae},
journal = {J. Algorithms},
keywords = {dblp},
number = 1,
pages = {157-173},
timestamp = {2016-02-02T05:33:07.000+0100},
title = {The Complexity of Scheduling Trees with Communication Delays.},
url = {http://dblp.uni-trier.de/db/journals/jal/jal20.html#LenstraVV96},
volume = 20,
year = 1996
}
