31 citations · 155 across the 25 of their papers we have counts for
39 papers
Data Reductions for the Strong Maximum Independent Set Problem in Hypergraphs
Ernestine Großmann, Christian Schulz, Darren Strash +1
This work addresses the well-known Maximum Independent Set problem in the context of hypergraphs. While this problem has been extensively studied on graphs, we focus on its strong…
Open Problems in (Hyper)Graph Decomposition
Deepak Ajwani, Rob H. Bisseling, Katrin Casel +26
Large networks are useful in a wide range of applications. Sometimes problem instances are composed of billions of entities. Decomposing and analyzing these structures helps us gai…
A Dual-mode Local Search Algorithm for Solving the Minimum Dominating Set Problem
Enqiang Zhu, Yu Zhang, Shengzhi Wang +2
Given a graph, the minimum dominating set (MinDS) problem is to identify a smallest set of vertices such that every vertex not in is adjacent to at least one vertex in .…
Solving Edge Clique Cover Exactly via Synergistic Data Reduction
Anthony Hevia, Benjamin Kallus, Summer McClintic +3
The edge clique cover (ECC) problem -- where the goal is to find a minimum cardinality set of cliques that cover all the edges of a graph -- is a classic NP-hard problem that has r…
Improved Exact and Heuristic Algorithms for Maximum Weight Clique
Roman Erhardt, Kathrin Hanauer, Nils Kriege +2
We propose improved exact and heuristic algorithms for solving the maximum weight clique problem, a well-known problem in graph theory with many applications. Our algorithms interl…
Finding Near-Optimal Weight Independent Sets at Scale
Ernestine Großmann, Sebastian Lamm, Christian Schulz +1
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 redu…