Solving medium to large sized euclidean generalized minimum spanning tree problems
By: Diptesh Ghosh.
Contributors: Indian Institute of Management, Ahmedabad.
Series: Working paper ;; W.P. no. 2003-08-02; Working paper (Indian Institute of Management, Ahmedabad) ;; W.P. no. 2003-08-02.
Publisher: Indian Institute of Management
Published: 2003
Place of publication: Ahmedabad
Language: eng
Format: Microform
Number of pages: 15
Subjects: Trees (Graph theory) -- Data processing.; Euclidean algorithm -- Data processing.; Fault-tolerant computing.
Notes: Microfiche. New Delhi : Library of Congress Office ; Washington, D.C. : Library of Congress Photoduplication Service, 2005. 1 microfiche. Master microform held by: DLC.
Includes bibliographical references (leaves 14-15).