<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-04-14T08:50:22Z</responseDate><request verb="GetRecord" identifier="oai:www.recercat.cat:10459.1/463181" metadataPrefix="oai_dc">https://recercat.cat/oai/request</request><GetRecord><record><header><identifier>oai:recercat.cat:10459.1/463181</identifier><datestamp>2025-09-15T18:40:13Z</datestamp><setSpec>com_2072_3622</setSpec><setSpec>col_2072_479130</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   <dc:title>Approximate and Optimal Solutions for the Bipartite Polarization Problem</dc:title>
   <dc:creator>Alsinet, Teresa</dc:creator>
   <dc:creator>Argelich Romà, Josep</dc:creator>
   <dc:creator>Béjar Torres, Ramón</dc:creator>
   <dc:creator>Martínez Rodríguez, Santi</dc:creator>
   <dc:subject>Social Networks</dc:subject>
   <dc:subject>Polarization</dc:subject>
   <dc:subject>Combinatorial Optimization</dc:subject>
   <dc:description>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’s 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.</dc:description>
   <dc:description>This work was partially funded by Spanish Project PID2019- 111544GB-C22 (MINECO / FEDER), by the European Union’s Horizon 2020 Research and Innovation Program under Grant Agreements 723596, 768824, 764025 and 814945, and by 2017 SGR 1537.</dc:description>
   <dc:date>2022-10-17</dc:date>
   <dc:type>info:eu-repo/semantics/article</dc:type>
   <dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
   <dc:identifier>https://doi.org/10.3233/FAIA220309</dc:identifier>
   <dc:identifier>9781643683263</dc:identifier>
   <dc:identifier>09226389</dc:identifier>
   <dc:identifier>https://hdl.handle.net/10459.1/463181</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-111544GB-C22/ES/SISTEMAS DE INFERENCIA PARA INFORMACION INCONSISTENTE: ANALISIS ARGUMENTATIVO/</dc:relation>
   <dc:relation>Reproducció del document publicat a http://doi.org/10.3233/FAIA220309</dc:relation>
   <dc:relation>Frontiers in Artificial Intelligence and Applications, 2022, vol. 356, p. 17-24, 24th International Conference of the Catalan Association for Artificial Intelligence, CCIA 2022, Sitges, 19-21 octubre 2022</dc:relation>
   <dc:relation>Frontiers in Artificial Intelligence and Applications</dc:relation>
   <dc:relation>info:eu-repo/grantAgreement/EC/H2020/723596/EU/Innova MicroSolar</dc:relation>
   <dc:relation>info:eu-repo/grantAgreement/EC/H2020/768824/EU/HYBUILD</dc:relation>
   <dc:relation>info:eu-repo/grantAgreement/EC/H2020/764025/EU/SWS-HEATING</dc:relation>
   <dc:relation>info:eu-repo/grantAgreement/EC/H2020/814945/EU/SolBio-Rev</dc:relation>
   <dc:rights>cc-by-nc, (c) Alsinet et al., 2022</dc:rights>
   <dc:rights>cc-by-nc, (c) IOS Press, 2022</dc:rights>
   <dc:rights>Attribution-NonCommercial 4.0 International</dc:rights>
   <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
   <dc:rights>http://creativecommons.org/licenses/by-nc/4.0/</dc:rights>
   <dc:publisher>IOS Press</dc:publisher>
</oai_dc:dc></metadata></record></GetRecord></OAI-PMH>