A Provably Asymptotically Fast Version of the Generalized Jensen Algorithm for Non-dominated Sorting

@inproceedings{Buzdalov2014APA,
  title={A Provably Asymptotically Fast Version of the Generalized Jensen Algorithm for Non-dominated Sorting},
  author={Maxim Buzdalov and Anatoly Shalyto},
  booktitle={PPSN},
  year={2014}
}
The non-dominated sorting algorithm by Jensen, generalized by Fortin et al to handle the cases of equal objective values, has the running time complexity of O(N logK−1 N) in the general case. Here N is the number of points, K is the number of objectives and K is thought to be a constant when N varies. However, the complexity was not proven to be the same in the worst case. A slightly modified version of the algorithm is presented, for which it is proven that its worst-case running time… CONTINUE READING
Highly Cited
This paper has 38 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 22 extracted citations

Similar Papers

Loading similar papers…