Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!elroy.jpl.nasa.gov!swrinde!zaphod.mps.ohio-state.edu!cis.ohio-state.edu!tut.cis.ohio-state.edu!cis.ohio-state.edu
From: wenger@cis.ohio-state.edu (Rephael Wenger)
Newsgroups: comp.theory
Subject: minimum spanning ellipsoids
Message-ID: <123810@tut.cis.ohio-state.edu>
Date: 21 May 91 16:52:32 GMT
Sender: news@tut.cis.ohio-state.edu
Organization: The Ohio State University, Department of Computer and Information Science
Lines: 7


In the 1984 STOC, Mark J. Post had a paper on finding minimum
spanning ellipsoids in O(n^2) time.  Has there been any 
substantial work on this problem or improvements to his algorithm
since then?

- R. Wenger