1. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and approximation. In: Combinatorial optimization problems and their approximability properties. Springer, Heidelberg (1999)
2. Garey, M., Johnson, D.: Computer and Intractability: A Guide to the theory of NP-completeness. Freeman, New York (1979)
3. Kouvelis, P., Yu, G.: Robust Discrete Optimization and its Applications. Kluwer Academic Publishers, Boston (1997)
4. Mahajan, M., Vinay, V.: Determinants: combinatorics, algorithms, and complexity. In: Proceedings of the Eigth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, New Orleans, USA, pp. 730–738 (1997)
5. Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: IEEE Symposium on Foundations of Computer Science, pp. 86–92 (2000)