Constant-factor LP-based approximation for Max Dist-2 Independent Set (and Min Dominating Set) in bounded radius-2 merge-width graphs, with the domination-to-2-independence ratio shown bounded and tight for radius-1.
χ-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Constant-factor approximation of maximum distance-2 independent set in graphs of bounded merge-width
Constant-factor LP-based approximation for Max Dist-2 Independent Set (and Min Dominating Set) in bounded radius-2 merge-width graphs, with the domination-to-2-independence ratio shown bounded and tight for radius-1.