{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T12:43:59Z","timestamp":1666010639678},"reference-count":0,"publisher":"IOS Press","license":[{"start":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T00:00:00Z","timestamp":1665964800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,10,17]]},"abstract":"<jats:p>In a recent work we introduced a problem about finding the highest polarized bipartition on a weighted and labeled graph that represents a debate developed trough some social network, where nodes represent user\u2019s opinions and edges agreement or disagreement between users. Finding this target bipartition is an optimization problem that can be seen as a generalization of the maxcut problem, so we first introduced a basic local search algorithm to find approximate solutions of the problem. In this paper we go one step further, and we present an exact algorithm for finding the optimal solution, based on an integer programming formulation, and compare the performance of a new variant of our local search algorithm with the exact algorithm. Our results show that at least on real instances of the problem, obtained from Reddit debates, the approximate solutions obtained are almost always identical to the optimal solutions.<\/jats:p>","DOI":"10.3233\/faia220309","type":"book-chapter","created":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T12:18:55Z","timestamp":1666009135000},"source":"Crossref","is-referenced-by-count":0,"title":["Approximate and Optimal Solutions for the Bipartite Polarization Problem"],"prefix":"10.3233","author":[{"given":"Teresa","family":"Alsinet","sequence":"first","affiliation":[{"name":"INSPIRES Research Center \u2013 University of Lleida, Jaume II, 69 \u2013 25001 Lleida, Spain"}]},{"given":"Josep","family":"Argelich","sequence":"additional","affiliation":[{"name":"INSPIRES Research Center \u2013 University of Lleida, Jaume II, 69 \u2013 25001 Lleida, Spain"}]},{"given":"Ram\u00f3n","family":"B\u00e9jar","sequence":"additional","affiliation":[{"name":"INSPIRES Research Center \u2013 University of Lleida, Jaume II, 69 \u2013 25001 Lleida, Spain"}]},{"given":"Santi","family":"Mart\u00ednez","sequence":"additional","affiliation":[{"name":"INSPIRES Research Center \u2013 University of Lleida, Jaume II, 69 \u2013 25001 Lleida, Spain"}]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","Artificial Intelligence Research and Development"],"original-title":[],"link":[{"URL":"https:\/\/ebooks.iospress.nl\/pdf\/doi\/10.3233\/FAIA220309","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T12:18:57Z","timestamp":1666009137000},"score":1,"resource":{"primary":{"URL":"https:\/\/ebooks.iospress.nl\/doi\/10.3233\/FAIA220309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,17]]},"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/faia220309","relation":{},"ISSN":["0922-6389","1879-8314"],"issn-type":[{"value":"0922-6389","type":"print"},{"value":"1879-8314","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,17]]}}}