Constant-factor approximation of maximum distance-2 independent set in graphs of bounded merge-width
The paper provides constant-factor approximation algorithms for Max Dist-2 Independent Set and Min Dominating Set in graphs of bounded radius-2 merge-width.
Provides constant-factor approximation algorithms and demonstrates the bound on the domination-to-2-independence ratio in graphs of bounded radius-2 merge-width.
Before reading this…
Applications
- →Computational geometry
- →Network design
- →Data clustering
To understand this paper, make sure you know these concepts first:
- Graph theoryfind papers →
- Linear programmingfind papers →
Abstract
More Like ThisWe give a constant-factor approximation algorithm for Max Dist-2 Independent Set in graphs of bounded radius-2 merge-width. The same result holds for Min Dominating Set from [Bonamy and Geniet, 2025], [Chan et al., SODA '12]. Both approximation algorithms are LP-based, showing that the domination-to-2-independence ratio is bounded in graphs of bounded radius-2 merge-width. Moreover, this result is tight in the sense that the ratio can be unbounded in graphs of bounded radius-1 merge-width.