Work

Approximation ratio of the min-degree greedy algorithm for Maximum Independent Set on interval and chordal graphs

Year: 2024

Type: article

Abstract: In this article we prove that the minimum-degree greedy algorithm, with adversarial tie-breaking, is a ( 2 / 3 ) -approximation for the Maximum Independent Set problem on interval graphs. We show that this is tight, even on unit interval graphs of maximum degree 3. We show that on chordal graphs, the greedy algorithm is a ( 1 / 2 ) -approximation and that this is again tight. These results contrast with the known (tight) approximation ratio of 3 Δ + 2 of the greedy algorithm for general graphs of maximum degree Δ .

Source: Discrete Applied Mathematics

DOI: 10.1016/j.dam.2024.09.009

Authors: Steven Chaplick, Martin Frohn, Steven Kelk, Johann Lottermoser, Matúš Mihalák

Institution: Maastricht University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $2,860

Funder: Nederlandse Organisatie voor Wetenschappelijk Onderzoek