Answers are grounded in this paper and cite their sources.
By modifying the simplex method of linear programming, we are able to present an algorithm for l₁-approximation which appears to, be superior computationally to any other known algorithm for this problem.
No takes yet. Share an insight, caveat, or question.
Barrodale et al. (1973) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: