Summary: APPROXIMATING THE TREE AND TOUR COVERS OF A GRAPH
Esther M. Arkin y
Department of Applied Mathematics and Statistics
SUNY Stony Brook
Stony Brook, NY 11794­3600
estie@ams.sunysb.edu
Magn'us M. Halld'orsson
School of Information Science
Japan Advanced Institute of Science and Technology -- Hokuriku
Tatsunokuchi, Ishikawa 923­12, Japan
magnus@jaist­east.ac.jp
Refael Hassin
Department of Statistics and Operations Research
School of Mathematical Sciences
Tel­Aviv University
Tel­Aviv 69978, Israel
hassin@math.tau.ac.il
August 25, 1995
Abstract
The tree and tour cover problems on an edge­weighted graph are to compute a minimum weight tree and

Source: Arkin, Estie - Department of Applied Mathematics and Statistics, SUNY at Stony Brook

Collections: Mathematics