no code implementations • 19 Apr 2018 • Naoki Hamada, Keisuke Goto
We give a theory of how to recognize the topology of the Pareto set from data and implement an algorithm to judge whether the true Pareto set may form a topological simplex or not.
1 code implementation • 3 Mar 2017 • Keisuke Goto
For the word RAM model, we propose algorithms to solve both of the problems in $O(N)$ time by using $O(1)$ extra words, which are optimal in time and space.
Data Structures and Algorithms
