no code implementations • 13 Jan 2020 • Florian Seiffarth, Tamas Horvath, Stefan Wrobel
As a first approach to overcome this negative result, we relax the problem to maximal closed set separation, give a generic greedy algorithm solving this problem with a linear number of closure operator calls, and show that this bound is sharp.