The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Rounding of Polytopes in the Real Number Model of Computation
Abstract
Let 𝒜 be a set of m points in ℝ n. We show that the problem of (1 + ϵ)n-rounding of 𝒜, i.e., the problem of computing an ellipsoid E ⊆ ℝ n such that [(1 + ϵ)n]−1 E ⊆ conv. hull(𝒜) ⊆ E, can be solved in O(mn 2(ϵ−1 + ln n + ln ln m)) arithmetic operations and comparisons. This result implies that the problem of approximating the minimum volume ellipsoid circumscribed about 𝒜 can be solved in O(m 3.5 ln(mϵ−1)) operations to a relative accuracy of ϵ in the volume. The latter bound also applies to the (1 + ϵ)n-rounding problem. Our bounds hold for the real number model of computation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Theory of Linear and Integer Programming
Letchford, A. N., & Schrijver, A. (2000) · The Journal of the Operational Research Society · doi:10.2307/253980 · Cited by 5,515
Fedorov, V. V., Studden, W. J., & Klimko, E. M. (1972) · Cited by 2,092
The ellipsoid method and its consequences in combinatorial optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1981) · Combinatorica · doi:10.1007/bf02579273 · Cited by 2,011
Integer Programming with a Fixed Number of Variables
Lenstra, H. W. (1983) · Mathematics of Operations Research · doi:10.1287/moor.8.4.538 · Cited by 1,440
The Equivalence of Two Extremum Problems
Kiefer, J., & Wolfowitz, J. (1960) · Canadian Journal of Mathematics · doi:10.4153/cjm-1960-030-4 · Cited by 879
Smallest enclosing disks (balls and ellipsoids)
Welzl, E. (2006) · Lecture Notes in Computer Science · doi:10.1007/bfb0038202 · Cited by 791
A random polynomial-time algorithm for approximating the volume of convex bodies
Dyer, M., Frieze, A., & Kannan, R. (1991) · Journal of the ACM · doi:10.1145/102782.102783 · Cited by 693
Optimal Design: Some Geometrical Aspects of D-Optimality
Titterington, D. M. (1975) · Biometrika · doi:10.1093/biomet/62.2.313 · Cited by 116
Cited by
Zwanenburg, A., Vallières, M., Abdalah, M. A., Aerts, H. J. W. L., Andrearczyk, V., Apte, A., Ashrafinia, S., Bakas, S., Beukinga, R. J., Boellaard, R., et al. (2020) · Radiology · doi:10.1148/radiol.2020191145 · Cited by 4,177
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
Clarkson, K. L. (2010) · ACM Transactions on Algorithms · doi:10.1145/1824777.1824783 · Cited by 379
Metadata
- Authors
- Khachiyan, L. G.
- Venue
- Mathematics of Operations Research
- Published
- 1996-05
- Volume
- 21
- Issue
- 2
- Pages
- 307-320
- ISSN
- 0364-765X (ISSN-L)
- 1526-5471
- OpenAlex
- W2138663260
- Cited by
- 273
- References
- 8
- FWCI
- 1.03
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Rounding of Polytopes in the Real Number Model of Computation. https://app.cochat.ai/papers/10.1287/moor.21.2.307
- The paper
- Khachiyan, L. G. (1996). Rounding of Polytopes in the Real Number Model of Computation. Mathematics of Operations Research. https://doi.org/10.1287/moor.21.2.307
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.