![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.220, Iss.1, 1999-06, pp. : 157-183
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Bounds on the Greedy Routing Algorithm for Array Networks
Journal of Computer and System Sciences, Vol. 53, Iss. 3, 1996-12 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Greedy scheduling with custom-made objectives
Annals of Operations Research, Vol. 180, Iss. 1, 2010-11 ,pp. :