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.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Establishes γ(G) ≤ 16ρ(G) for unit disk graphs and γ(G) ≤ (7/4)ρ(G) + 5/6 for bridgeless claw-free cubic graphs, with infinite families showing the bounds are not tight.
Establishes that ι/γ₂ < 2 holds for all trees while γ/ρ_L is unbounded there, gives class-specific bounds on γ/ρ_L, and shows every tree admits an isolating packing set.
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.
-
Improved Domination--Packing Bounds in Claw-Free Cubic Graphs and Unit Disk Graphs
Establishes γ(G) ≤ 16ρ(G) for unit disk graphs and γ(G) ≤ (7/4)ρ(G) + 5/6 for bridgeless claw-free cubic graphs, with infinite families showing the bounds are not tight.
-
On the Relationships between Domination, Isolation, and Packing
Establishes that ι/γ₂ < 2 holds for all trees while γ/ρ_L is unbounded there, gives class-specific bounds on γ/ρ_L, and shows every tree admits an isolating packing set.