On Approximation Preserving Reductions : Complete Problems and Robust Measures ( Revised Version )

@inproceedings{Orponen1987OnAP,
  title={On Approximation Preserving Reductions : Complete Problems and Robust Measures ( Revised Version )},
  author={Pekka Orponen and Heikki Mannila},
  year={1987}
}
We investigate the well-known anomalous differences in the approximability properties of NP-complete optimization problems. We define a notion of polynomial time reduction between optimization problems, and introduce conditions guaranteeing that such reductions preserve various types of approximate solutions. We then prove that a weighted version of the satisfiability problem, the traveling salesperson problem, and the zero-one integer programming problem are in a strong sense approximation… CONTINUE READING
Highly Influential
This paper has highly influenced 15 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
64 Citations
15 References
Similar Papers

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…