2 papers
cs.DS2008
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
Ilias Diakonikolas, Mihalis Yannakakis
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We s…
cs.CC2008
Efficiently Testing Sparse GF(2) Polynomials
Ilias Diakonikolas, Homin K. Lee, Kevin Matulef +2
We give the first algorithm that is both query-efficient and time-efficient for testing whether an unknown function is an -sparse GF(2) polynomial ver…