A polynomial time approximation scheme for minimum routing cost spanning trees

Full Text:

PDF

Buy this Article

Authors:	Bang Ye Wu	Dept. of C.S., National Tsing Hua University, Hsinchu, Taiwan, R.O.C.
	Giuseppe Lancia	Dipartimento di Elettronica e Informatica, Università di Padova, Italy
	Vineet Bafna	Bioinformatics, SmithKline Beecham, King of Prussia, PA
	Kun-Mao Chao	Dept. of C.S. and Inform. Manag., Providence University, Shalu, Taiwan, R.O.C.
	R. Ravi	GSIA, Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA
	Chuan Yi Tang	Dept. of C.S., National Tsing Hua University, Hsinchu, Taiwan, R.O.C.

	1998 Article
Bibliometrics
· Downloads (6 Weeks): 0 · Downloads (12 Months): 19 · Downloads (cumulative): 749 · Citation Count: 23

Published in:

· Proceeding

SODA '98 Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

Pages 21-32
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©1998
table of contents ISBN:0-89871-410-9

Tools and Resources