None of the three main upper bounds for the edge-weighted maximum clique problem has a bounded ratio to the optimum, and their relative strengths can be made arbitrarily different on appropriately chosen instance families.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Strength of the Upper Bounds for the Edge-Weighted Maximum Clique Problem
None of the three main upper bounds for the edge-weighted maximum clique problem has a bounded ratio to the optimum, and their relative strengths can be made arbitrarily different on appropriately chosen instance families.