The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Linear Programming in Linear Time When the Dimension Is Fixed
Open accessAbstract
It is demonstrated that the linear programming problem in d variables and n constraints can be solved in O(n) time when d is fixed.This bound follows from a multidimensional search technique which is applicable for quadratic programming as well.There is also developed an algorithm that is polynomial in both n and d provided d is bounded by a certain slowly growing function of n.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Linear Programming and Extensions
Dantzig, G. (1963) · RAND Corporation eBooks · doi:10.7249/r366 · Cited by 5,755
Polynomial algorithms in linear programming
Khachiyan, L. G. (1980) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(80)90061-0 · Cited by 1,992
HOW GOOD IS THE SIMPLEX ALGORITHM
Klee, V. L., & Minty, G. J. (1970) · Cited by 1,076
Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
Megiddo, N. (1983) · SIAM Journal on Computing · doi:10.1137/0212052 · Cited by 837
Self-citationMultidimensional divide-and-conquer
Bentley, J. L. (1980) · Communications of the ACM · doi:10.1145/358841.358850 · Cited by 672
Computer-Oriented Approaches to Pattern Recognition
(1972) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6008-4 · Cited by 360
Expected time bounds for selection
Floyd, R. W., & Rivest, R. L. (1975) · Communications of the ACM · doi:10.1145/360680.360691 · Cited by 279
Cited by
Learnability and the Vapnik-Chervonenkis dimension
Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1989) · Journal of the ACM · doi:10.1145/76359.76371 · Cited by 1,839
(1989) · European Journal of Operational Research · doi:10.1016/0377-2217(89)90373-1 · Cited by 1,324
The NP-completeness column: An ongoing guide
Johnson, D. S. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90020-9 · Cited by 794
Applications of random sampling in computational geometry, II
Clarkson, K. L., & Shor, P. W. (1989) · Discrete & Computational Geometry · doi:10.1007/bf02187740 · Cited by 665
Voronoi Diagrams**Partially supported by the Deutsche Forschungsgemeinschaft, grant K1 655 2-2.
Aurenhammer, F., & Klein, R. (2000) · Handbook of Computational Geometry · doi:10.1016/b978-044482537-7/50006-1 · Cited by 392
Metadata
- Authors
- Megiddo, N.
- Venue
- Journal of the ACM
- Published
- 1984-01
- Volume
- 31
- Issue
- 1
- Pages
- 114-127
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W1993058867
- Cited by
- 669
- References
- 9
- FWCI
- 14.16
- Type
- journal article
- Language
- en
- Open access
- bronze
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
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.