Author:
Recski András,Szeszlér Dávid
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Aggarwal, A., M. Klawe, D. Lichtenstein, N. Linial, and A. Wigderson, 1991. A lower bound on the area of permutation layouts, Algorithmica 6, 241–255.
2. Aggarwal, A., J. Kleinberg, and D. P. Williamson, 2000. Node-disjoint paths on the mesh and a new trade-off in VLSI layout, SIAM J. Computing 29, 1321–1333.
3. Baker S. B., S. N. Bhatt, and F. T. Leighton, 1984. An approximation algorithm for Manhattan routing, Advances in Computing Research 2, 205–229.
4. Boros, E., A. Recski and F. Wettl, 1995. Unconstrained multilayer switchbox routing, Ann. Oper. Res. 58, 481–491.
5. Burstein, M. and R. Pelavin, 1983. Hierarchical wire routing, IEEE Trans. Computer-Aided Design CAD-2, 223–234.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献