Conference
On Optimal Approximations of Arbitrary Relations by Partial Orders
Abstract
The problem of optimal quantitative approximation of an arbitrary binary relation by a partial order is discussed and some solution is provided. It is shown that even for a very simple quantitative measure the problem is NP-hard. Some quantitative metrics are also applied for known property-driven approximations by partial orders.
Authors
Janicki R
Series
Lecture Notes in Computer Science
Volume
9920
Pagination
pp. 107-119
Publisher
Springer Nature
Publication Date
2016
DOI
10.1007/978-3-319-47160-0_10
Conference proceedings
Lecture Notes in Computer Science
ISSN
0302-9743