A 2-Dimensional Binary Search for Integer Pareto Frontiers
Data Structures and Algorithms
2022-01-25 v3
Abstract
For finite integer squares, we consider the problem of learning a classification that respects Pareto domination. The setup is natural in dynamic programming settings. We show that a generalization of the binary search algorithm achieves an optimal worst-case run time.
Cite
@article{arxiv.2111.06101,
title = {A 2-Dimensional Binary Search for Integer Pareto Frontiers},
author = {Yotam Gafni},
journal= {arXiv preprint arXiv:2111.06101},
year = {2022}
}
Comments
Found that this is a restatement of a known algorithm called Saddleback search: https://link.springer.com/chapter/10.1007/11783596_8