On the Approximability of Minimizing Nonzero Variables or Unsatisfied Relations in Linear Systems

  title={On the Approximability of Minimizing Nonzero Variables or Unsatisfied Relations in Linear Systems},
  author={Edoardo Amaldi and Viggo Kann},
  journal={Theor. Comput. Sci.},
We investigate the computational complexity of two closely related classes of combinatorial optimization problems for linear systems which arise in various elds such as machine learning, operations research and pattern recognition. In the rst class (Min ULR) one wishes, given a possibly infeasible system of linear relations, to nd a solution that violates as few relations as possible while satisfying all the others. In the second class (Min RVLS) the linear system is supposed to be feasible and… CONTINUE READING
Highly Influential
This paper has highly influenced 27 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 787 citations. REVIEW CITATIONS
314 Citations
61 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 314 extracted citations

788 Citations

Citations per Year
Semantic Scholar estimates that this publication has 788 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 61 references

Trees and Hills: Methodology for Maximizing Functions of Systems of Linear Re- lations, volume 22 of Annals of Discrete Mathematics

  • R. Greer
  • Elsevier science publishing company,
  • 1984
Highly Influential
5 Excerpts

Fundamentals of arti cial neural networks

  • M. Hassoun
  • 1995
Highly Influential
3 Excerpts

A note on resolving infeasibility in linear programs by constraint relaxation

  • J. Sankaran
  • Oper. Res. Letters,
  • 1993
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…