The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
An Improved Algorithm for Discrete $l_1 $ Linear Approximation
Abstract
By modifying the simplex method of linear programming, we are able to present an algorithm for $l_1 $-approximation which appears to, be superior computationally to any other known algorithm for this problem.
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
Linear Programming and Extensions
Dantzig, G. (1963) · Princeton University Press eBooks · doi:10.1515/9781400884179 · Cited by 2,713
Linear Programming. Methods and Applications
Vajda, S., & Gass, S. I. (1964) · OR · doi:10.2307/3007132 · Cited by 112
L 1 Approximation and the Analysis of Data
Barrodale, I. (1968) · Journal of the Royal Statistical Society Series C (Applied Statistics) · doi:10.2307/2985267 · Cited by 84
Self-citationApplications of Mathematical Programming to ℓp Approximation
Barrodale, I., & Roberts, F. D. K. (1970) · Elsevier eBooks · doi:10.1016/b978-0-12-597050-1.50020-8 · Cited by 39
Self-citation
Cited by
Robust regression using iteratively reweighted least-squares.
Holland, P. W., & Welsch, R. E. (1977) · Communications in Statistics - Theory and Methods · doi:10.1080/03610927708827533 · Cited by 2,115
Abadie, A., Angrist, J., & Imbens, G. (2002) · Econometrica · doi:10.1111/1468-0262.00270 · Cited by 701
Green, P. J. (1984) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1984.tb01288.x · Cited by 687
Reverse engineering gene networks using singular value decomposition and robust regression
Yeung, M. K. S., Tegnér, J., & Collins, J. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.092576199 · Cited by 667
Estimating the asymptotic covariance matrix for quantile regression models a Monte Carlo study
Buchinsky, M. (1995) · Journal of Econometrics · doi:10.1016/0304-4076(94)01652-g · Cited by 434
Metadata
- Authors
- Barrodale, I., & Roberts, F. D. K.
- Venue
- SIAM Journal on Numerical Analysis
- Published
- 1973-10
- Volume
- 10
- Issue
- 5
- Pages
- 839-848
- ISSN
- 0036-1429 (ISSN-L)
- 1095-7170
- OpenAlex
- W2086847993
- Cited by
- 601
- References
- 4
- FWCI
- 4.30
- 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
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.