Ultimate Greedy Approximation of Independent Sets in Subcubic Graphs

We study the approximability of the maximum size independent set (MIS) problem in bounded degree graphs. This is one of the most classic and widely studied NP-hard optimization problems. It is known for its inherent hardness of approximation. We focus on the well known minimum-degree greedy algorith...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 86; no. 11; pp. 3518 - 3578
Main Authors:	Krysta, Piotr, Mari, Mathieu, Zhi, Nan
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.11.2024 Springer Nature B.V Springer Verlag
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Approximation Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Design analysis Graphs Greedy algorithms Hardness Lower bounds Mathematics of Computing Staples Theory of Computation Upper bounds Greedy algorithms 68Q25 Bounded degree graphs Approximation algorithms Independent set problem 68W25 90C27
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!