Technical Report CS0249

TR#:CS0249
Class:CS
Title: Algorithms For P-Center In A Weighted Tree
Authors: O. Kariv and M. Jeger
PDFCS0249.pdf
Abstract: Algorithms of O(p n log n) time to find qn (absolute or vertex p-center on a weighted tree are represented.
CopyrightThe above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information

Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1982/CS/CS0249), rather than to the URL of the PDF files directly. The latter URLs may change without notice.

To the list of the CS technical reports of 1982
To the main CS technical reports page

Computer science department, Technion
admin