We present new techniques to analyze natural local search algorithms for several variants of the max-sum diversification problem which, in its most basic form, is as follows: given an 𝑛-point set 𝑋 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback