A 2-Dimensional Binary Search for Integer Pareto Frontiers
Abstract
For finite integer squares, we consider the problem of learning a classification I 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 θ(n) worst-case run time.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.