Sciweavers

16 search results - page 4 / 4
» A Tight Lower Bound for the Steiner Point Removal Problem on...
Sort
View
FOCS
2007
IEEE
13 years 11 months ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova