{"ID":2896612,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2507.06898","arxiv_id":"2507.06898","title":"Strength of the Upper Bounds for the Edge-Weighted Maximum Clique Problem","abstract":"We theoretically and computationally compare the strength of the three main upper bounds from the literature on the optimal value of the Edge-Weighted Maximum Clique Problem (EWMCP). We provide a set of instances for which the ratio between any of the three upper bounds and the optimal value of the EWMCP is unbounded, showing that none of them can give a performance guarantee. We further analyze the relative strength among the three upper bounds by determining, for every choice of a ratio between any two of them, the largest values it can attain and providing families of instances for which such values can be reached. Our results show that, for each pair of upper bounds, there exist appropriately chosen instances on which either bound is tighter than the other. Our theoretical analysis is complemented by extensive computational experiments on two benchmark datasets: the standard DIMACS instances and randomly generated instances, providing practical insights into the empirical strength of the upper bounds.","short_abstract":"We theoretically and computationally compare the strength of the three main upper bounds from the literature on the optimal value of the Edge-Weighted Maximum Clique Problem (EWMCP). We provide a set of instances for which the ratio between any of the three upper bounds and the optimal value of the EWMCP is unbounded,...","url_abs":"https://arxiv.org/abs/2507.06898","url_pdf":"https://arxiv.org/pdf/2507.06898v2","authors":"[\"Fabio Ciccarelli\",\"Valerio Dose\",\"Fabio Furini\",\"Marta Monaci\"]","published":"2025-07-09T14:35:00Z","proceeding":"math.OC","tasks":"[\"math.OC\",\"math.CO\"]","methods":"[]","has_code":false}