1. A. Brieden, On geometric optimization problems likely not contained in APX, Discrete Comp. Geom. 28 (2002), 201–209.
2. A. Brieden, On the approximability of (discrete) convex maximization and its contribution to the consolidation of farmland, Habilitationsschrift, Tech. Univ. Munich, Juni 2003.
3. A. Brieden and P. Gritzmann, On the inapproximability of polynomial programming, the geometry of stable sets, and the power of relaxation, The Goodman-Pollack Festschrift, Springer, New York (2003), 303–313.
4. A. Brieden and P. Gritzmann, Optimal k-clustering in Euclidean space, Preprint.
5. A. Brieden, P. Gritzmann, R. Kannan, V. Klee, L. Lovász, and M. Simonovits, Approximation of radii and norm-maxima: Randomization doesn’t help, Proc. 39th IEEE FOCS, 1998, pp. 244–251.