This paper studies the complexity of computing (or approximating, or bounding) the various inner and outer radii of an n-dimensional convex polytope in the space N" equipped with an gp norm or aâ€¦ (More)

In 1957 W.M. Hirsch conjectured that every d-polytope with n facets has edge-diameter at most n ? d. Recently Holt and Klee constructed polytopes which meet this bound for a number of (d; n) pairsâ€¦ (More)

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, inâ€¦ (More)

This is the first part of a broaaer survey of computational convexity, an area of mathematics that has crystallized around a variety of results, problems and applications involving interactions amongâ€¦ (More)

We describe a deterministic polynomial-time algorithm which, for a convex body K in Euclideann-space, finds upper and lower bounds onK â€™s diameter which differ by a factor ofO( p n= logn). We showâ€¦ (More)

In [4], Ryll-Nardzewski gave what he called an 'old-fashioned' proof of his famous fixed point theorem. The purpose of the present note is to give an even more old-fashioned proof of the fixed pointâ€¦ (More)