Polarization reduction by minimum‐cardinality edge additions: Complexity and integer programming approaches

DOI10.1111/ITOR.12854OpenAlexW3046241465MaRDI QIDQ6070501

Unnamed Author, Ruben Interian, Celso Carneiro Ribeiro

Publication date: 21 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12854

zbMATH Keywords

complexityinteger programmingpolarizationminimum-cardinality edge addition problempolarized networks

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

Network polarization, filter bubbles, and echo chambers: an annotated review of measures and reduction methods

Cites Work

• Unnamed Item
• Unnamed Item
• Improved approximability and non-approximability results for graph diameter decreasing problems
• On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
• A biased random-key genetic algorithm for the maximum quasi-clique problem
• On a network creation game
• Integer Programming Formulation of Traveling Salesman Problems
• Minimizing the Diameter of a Network Using Shortcut Edges
• Integer programming models for detecting graph bipartitions with structural requirements
• Detecting critical node structures on graphs: A mathematical programming approach
• An exact algorithm for the maximum quasi‐clique problem

This page was built for publication: Polarization reduction by minimum‐cardinality edge additions: Complexity and integer programming approaches