References
- Berge C. (1973) Graphs and Hypergraphs North Holland Amsterdam
- Garey M. R. Johnson D. S. (1979) Computers and intractability A Guide to the Theory of NP-Completeness W. H. Freeman San Francisco
- Papadimitriou , C. H. and Yannakakis , M. (1991) . Optimization, approximation and complexity classes . J. Comput. System Sci. , 43 : 425 – 440 .
- Orponen P. Mannila H. (1987) On approximation preserving reductions: complete problems and robust measures Technical Report G-1987-28 Department of Computer Science, University of Helsinki Finland
- Trevisan L. (1997) Reduction and (non-)Approximability PhD thesis Università degli Studi di Roma “La Sapienza“
- Simon , H. U. (1990) . On approximate solutions for combinatorial optimization problems . SIAM J. Disc. Math. , 3 ( 2 ) : 294 – 310 .
- Demange , M. and Paschos , V. TH. (1996) . On an approximation measure founded on the links between optimization and polynomial approximation theory . Theor. Comput. Sci. , 158 : 117 – 141 .
- Paschos , V. TH. and Renotte , L. (1995) . Approximability preserving reductions for NP-complete problems . Foundations Computing Decision Sci. , 20 ( 1 ) : 49 – 71 .
- Ausiello , G. , D'Atri , A. and Protasi , M. (1980) . Structure preserving reductions among convex optimization problems . J. Comput. System Sci. , 21 : 136 – 153 .
- Demange , M. , Grisoni , P. and Paschos , V. TH. (1998) . Differential approximation algorithms for some combinatorial optimization problems . Theor. Comput. Sci. , 209 : 107 – 122 .