Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard

Mathematical Programming, Series B

Volumn 86, Issue 1, 1999, Pages 219-223

  Tunçel, Levent ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Complexity measure; Computational complexity; Linear programming

Indexed keywords

EID: 0010217347     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050087     Document Type: Article

References (5)

1. Khachiyan, L. (1995): On the complexity of approximating extremal determinants in matrices. J. Complexity 11, 138-153
2. Khachiyan, L.: private communication, June 1997
3. Megiddo, N., Mizuno, S., Tsuchiya, T. (1998): A modified layered-step interior-point algorithm for linear programming. Math. Program. 82, 339-355
4. Todd, M.J., Tunçel, L., Ye, Y.: Probabilistic analysis of two complexity measures for linear programming problems. MSRI Preprint 1998-054, Berkeley, CA, USA, October 1998
5. Vavasis, S.A., Ye, Y. (1996): A primal-dual interior point method whose running time depends only on the constraint matrix. Math. Program. 74, 79-120