Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs
From MaRDI portal
Publication:5232762
DOI10.1137/1.9781611975499.12zbMath1430.68226arXiv1810.10834OpenAlexW2898323380MaRDI QIDQ5232762
Huashuo Zhang, Sebastian Lamm, Robert Williger, Darren Strash, Christian Schulz
Publication date: 13 September 2019
Published in: 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.10834
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Unnamed Item, Exact algorithms for maximum weighted independent set on sparse graphs (extended abstract), A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs, Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness
