Jon Lee, François Margot
INFORMS Journal on Computing
We consider optimization of nonlinear objective functions that balance d linear criteria over n-element independence systems presented by linear-optimization oracles. For d=1, we have previously shown that an r-best approximate solution can be found in polynomial time. Here, using an extended ErdsKoRado theorem of Frankl, we show that for d=2, finding a ρn-best solution requires exponential time. © 2011 Elsevier B.V. All rights reserved.
Jon Lee, François Margot
INFORMS Journal on Computing
Jon Lee, Maxim Sviridenko, et al.
SIAM Journal on Computing
Jon Lee, Vahab S. Mirrokni, et al.
SIAM Journal on Discrete Mathematics
Jörg Bader, Robert Hildebrand, et al.
Mathematical Programming