Finding Near-Optimal Weight Independent Sets at Scale

Computing maximum weight independent sets in graphs is an important NP-hard optimization problem. The problem is particularly difficult to solve in large graphs for which data reduction techniques do not work well. To be more precise, state-of-the-art branch-and-reduce algorithms can solve many larg...

Full description

Bibliographic Details

Published in:	Journal of graph algorithms and applications Vol. 28; no. 1; pp. 439 - 473
Main Authors:	Großmann, Ernestine, Lamm, Sebastian, Schulz, Christian, Strash, Darren
Format:	Journal Article
Language:	English
Published:	15.11.2024
ISSN:	1526-1719, 1526-1719
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!