%0 Journal Article %1 journals/algorithmica/KalpakisY99 %A Kalpakis, Konstantinos %A Yesha, Yaacov %D 1999 %J Algorithmica %K dblp %N 2 %P 159-179 %T Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays. %U http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica23.html#KalpakisY99 %V 23

@article{journals/algorithmica/KalpakisY99, added-at = {2011-05-18T00:00:00.000+0200}, author = {Kalpakis, Konstantinos and Yesha, Yaacov}, biburl = {https://www.bibsonomy.org/bibtex/25f8bbcf6e18b161925dca53bbd889185/dblp}, ee = {http://dx.doi.org/10.1007/PL00009254}, interhash = {50130f8a4885a43be38b97bdc1f4c60d}, intrahash = {5f8bbcf6e18b161925dca53bbd889185}, journal = {Algorithmica}, keywords = {dblp}, number = 2, pages = {159-179}, timestamp = {2011-05-19T11:34:58.000+0200}, title = {Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays.}, url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica23.html#KalpakisY99}, volume = 23, year = 1999 }