Two Steiner tree packing problems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Two Steiner tree packing problems

Full text

Pdf (377 KB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the twenty-seventh annual ACM symposium on Theory of computing table of contents

Las Vegas, Nevada, United States

Pages: 383 - 387

Year of Publication: 1995

ISBN:0-89791-718-9

Author

William R. Pulleyblank

Mathematical Sciences Department, I.B.M. Research, Yorktown Heights, NY

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 33, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/225058.225163 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	A. Aggarwal, M. Klawe, D. Liechtenstein, N. Linial A. Widgerson, A lower bound on the area of Permuta-tion Layouts, Algorithmic 6 (1991), 241-255.
	2	A. Aggarwal, M. Klawe and P. Shor, Multilayer embedding for VLSI, Algorithmic 6 (1991) 129-
	3	Robert C. Carden, IV , Chung-Kuan Cheng, A global router using an efficient approximate multicommodity multiterminal flow algorithm, Proceedings of the 28th conference on ACM/IEEE design automation, p.316-321, June 17-22, 1991, San Francisco, California, United States [doi>10.1145/127601.127687]
	4	Ching-Wei Yeh , Chung-Kuan Cheng , Ting-Ting Y. Lin, A probabilistic multicommodity-flow solution to circuit clustering problems, Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design, p.428-431, November 1992, Santa Clara, California, United States
	5	M. Cutler and Y. Shiloach, Permutation layout, works 8 (1978) 253-278.
	6	S. Gao , M. Jerrum , M. Kaufman , K. Mehlhorn , W. Rülling, On continuous Homotopic one layer routing, Proceedings of the fourth annual symposium on Computational geometry, p.392-402, June 06-08, 1988, Urbana-Champaign, Illinois, United States [doi>10.1145/73393.73433]
	7	T.C. Hu and M.T. Shing, A Decomposition Algorithm for Circuit Routing, Mathematical Programming 24 (1985) 87-103.
	8	F.K. Hwang and D.S. Richards, Steiner tree problems, Networks 22 (1992) 55-89.
	9	F.K. Hvvrmg, D.S. Richards and P. Winter, The Steiner Tkee Problem, Annals of Discrete Mathematics 53 (1992).
	10	C E Leiserson , F M Maley, Algorithms for routing and testing routability of planar VLSI layouts, Proceedings of the seventeenth annual ACM symposium on Theory of computing, p.69-78, May 06-08, 1985, Providence, Rhode Island, United States [doi>10.1145/22145.22153]
	11	A. P. C. Ng , P. Radhavan , C. D. Thompson, Experimental results for a linear program global router, Computers and Artificial Intelligence, v.6 n.3, p.229-242, July 1987
	12	Prabhakar Raghavan, Integer programming in VLSI design, Discrete Applied Mathematics, v.40 n.1, p.29-43, Nov. 18, 1992 [doi>10.1016/0166-218X(92)90020-B]
	13	E. Shragowitz and S. Keel, A global router based on a multicommodit y flow model, preprint.

CITED BY 3

	Alok Aggarwal , Jon Kleinberg , David P. Williamson, Node-disjoint paths on the mesh and a new trade-off in VLSI layout, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.585-594, May 22-24, 1996, Philadelphia, Pennsylvania, United States
	Tamás Terlaky , Anthony Vannelli , Hu Zhang, On routing in VLSI design and communication networks, Discrete Applied Mathematics, v.156 n.11, p.2178-2194, June, 2008
	Rachid Hadid , Mehmet Hakan Karaata, An adaptive stabilizing algorithm for finding all disjoint paths in anonymous mesh networks, Computer Communications, v.32 n.5, p.858-866, March, 2009