@inproceedings{cf523c4997dd4d06a117f14826e699dc,

title = "Separation between estimation and approximation",

abstract = "We show (under standard assumptions) that there are NP optimization problems for which estimation is easier than approximation. Namely, one can estimate the value of the optimal solution within a ratio of ρ, but it is difficult to find a solution whose value is within ρ of optimal. As an important special case, we show that there are linear programming relaxations for which no polynomial time rounding technique matches the integrality gap of the linear program.",

author = "Uriel Feige and Shlomo Jozpeh",

year = "2015",

month = jan,

day = "11",

doi = "https://doi.org/10.1145/2688073.2688101",

language = "الإنجليزيّة",

series = "ITCS 2015 - Proceedings of the 6th Innovations in Theoretical Computer Science",

pages = "271--276",

booktitle = "ITCS 2015 - Proceedings of the 6th Innovations in Theoretical Computer Science",

note = "6th Conference on Innovations in Theoretical Computer Science, ITCS 2015 ; Conference date: 11-01-2015 Through 13-01-2015",

}