{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:23:38Z","timestamp":1760171018850},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319471594"},{"type":"electronic","value":"9783319471600"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-47160-0_10","type":"book-chapter","created":{"date-parts":[[2016,9,27]],"date-time":"2016-09-27T23:43:07Z","timestamp":1475019787000},"page":"107-119","source":"Crossref","is-referenced-by-count":1,"title":["On Optimal Approximations of Arbitrary Relations by Partial Orders"],"prefix":"10.1007","author":[{"given":"Ryszard","family":"Janicki","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,29]]},"reference":[{"key":"10_CR1","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, D.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)"},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0020-0190(93)90079-O","volume":"47","author":"P Eades","year":"1993","unstructured":"Eades, P., Lin, X., Smyth, W.F.: A fast and effective heuristic for the feedback arc set problem. Inf. Process. Lett. 47, 319\u2013323 (1993)","journal-title":"Inf. Process. Lett."},{"volume-title":"The Book of Traces","year":"1995","key":"10_CR3","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)"},{"key":"10_CR4","volume-title":"Interval Orders and Interval Graphs","author":"PC Fishburn","year":"1985","unstructured":"Fishburn, P.C.: Interval Orders and Interval Graphs. Wiley, New York (1985)"},{"key":"10_CR5","volume-title":"Decision Theory","author":"S French","year":"1986","unstructured":"French, S.: Decision Theory. Ellis Horwood, New York (1986)"},{"issue":"3","key":"10_CR6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(94)00086-7","volume":"51","author":"R Hassin","year":"1994","unstructured":"Hassin, R., Rubinstein, S.: Approximations for the maximum acyclic subgraph problem. Inf. Process. Lett. 51(3), 133\u2013140 (1994)","journal-title":"Inf. Process. Lett."},{"key":"10_CR7","first-page":"547","volume":"37","author":"P Jaccard","year":"1901","unstructured":"Jaccard, P.: \u00c9tude comparative de la distribution florale dans une portion des Alpes et des Jura. Bulletin de la Soci\u00e9t\u00e9 Vaudoise des Sciences Naturalles 37, 547\u2013549 (1901)","journal-title":"Bulletin de la Soci\u00e9t\u00e9 Vaudoise des Sciences Naturalles"},{"issue":"2","key":"10_CR8","doi-asserted-by":"crossref","first-page":"197","DOI":"10.3233\/FI-2009-126","volume":"94","author":"R Janicki","year":"2009","unstructured":"Janicki, R.: Pairwise comparisons based non-numerical ranking. Fundamenta Informaticae 94(2), 197\u2013217 (2009)","journal-title":"Fundamenta Informaticae"},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/978-3-642-18302-7_2","volume":"13","author":"R Janicki","year":"2011","unstructured":"Janicki, R.: Approximations of arbitrary binary relations by partial orders: classical and rough set models. Trans. Rough Sets 13, 17\u201338 (2011)","journal-title":"Trans. Rough Sets"},{"key":"10_CR10","series-title":"Intelligent Systems Reference Library","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/978-3-642-30344-9_12","volume-title":"Rough Sets and Intelligent Systems - Professor Zdzis\u0142aw Pawlak in Memoriam","author":"R Janicki","year":"2013","unstructured":"Janicki, R.: Property-driven rough sets approximations of relations. In: Skowron, A., Suraj, Z. (eds.) Rough Sets and Intelligent Systems - Professor Zdzis\u0142aw Pawlak in Memoriam. Intelligent Systems Reference Library, vol. 42, pp. 333\u2013357. Springer, Heidelberg (2013)"},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ijar.2015.12.014","volume":"71","author":"R Janicki","year":"2016","unstructured":"Janicki, R., Lenar\u010di\u010d, A.: Optimal approximations with rough sets and similarities in measure spaces. Int. J. Approx. Reason. 71, 1\u201314 (2016)","journal-title":"Int. J. Approx. Reason."},{"key":"10_CR12","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"M Karp","year":"1972","unstructured":"Karp, M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum, New York (1972)"},{"key":"10_CR13","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/978-3-540-78291-9_5","volume":"113","author":"J Kleijn","year":"2008","unstructured":"Kleijn, J., Koutny, M.: Formal languages and concurrent behaviour. Stud. Comput. Intell. 113, 125\u2013182 (2008)","journal-title":"Stud. Comput. Intell."},{"key":"10_CR14","first-page":"557","volume":"34","author":"Z Pawlak","year":"1982","unstructured":"Pawlak, Z.: Rough sets. Int. J. Comput. Inform. Sci. 34, 557\u2013590 (1982)","journal-title":"Int. J. Comput. Inform. Sci."},{"key":"10_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-3534-4","volume-title":"Rough Sets","author":"Z Pawlak","year":"1991","unstructured":"Pawlak, Z.: Rough Sets. Kluwer, Dordrecht (1991)"},{"key":"10_CR16","volume-title":"Algebra der Logik","author":"E Schr\u00f6der","year":"1895","unstructured":"Schr\u00f6der, E.: Algebra der Logik. Teuber, Leipzig (1895)"},{"key":"10_CR17","volume-title":"The Algorithm Design Manual","author":"S Skiena","year":"2010","unstructured":"Skiena, S.: The Algorithm Design Manual. Springer, London (2010)"},{"key":"10_CR18","doi-asserted-by":"crossref","first-page":"245","DOI":"10.3233\/FI-1996-272311","volume":"27","author":"A Skowron","year":"1996","unstructured":"Skowron, A., Stepaniuk, J.: Tolarence approximation spaces. Fundamenta Informaticae 27, 245\u2013253 (1996)","journal-title":"Fundamenta Informaticae"},{"issue":"4","key":"10_CR19","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1037\/0033-295X.84.4.327","volume":"84","author":"A Tversky","year":"1977","unstructured":"Tversky, A.: Features of similarity. Psychol. Rev. 84(4), 327\u2013352 (1977)","journal-title":"Psychol. Rev."},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-540-48061-7_12","volume-title":"New Directions in Rough Sets, Data Mining, and Granular-Soft Computing","author":"YY Yao","year":"1999","unstructured":"Yao, Y.Y., Wang, T.: On rough relations: an alternative formulation. In: Zhong, N., Skowron, A., Ohsuga, S. (eds.) RSFDGrC 1999. LNCS (LNAI), vol. 1711, pp. 82\u201390. Springer, Heidelberg (1999). doi: 10.1007\/978-3-540-48061-7_12"}],"container-title":["Lecture Notes in Computer Science","Rough Sets"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-47160-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,9]],"date-time":"2022-07-09T04:45:13Z","timestamp":1657341913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-47160-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319471594","9783319471600"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-47160-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}