On Efficacy of Approximating Arbitrary Relations by Partial Orders

The problem of optimal quantitative approximation of an arbitrary binary relation by a partial order is discussed and the results of some experiments are discussed. In general, this problem is NP-hard even for very simple quantitative measures, so some alternative sub-optimal but relatively efficient algorithms are discussed and tested.