19 citations · 39 across the 12 of their papers we have counts for
3 papers · 1 filter
Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics
Jialiang Li, Aneta Neumann, Frank Neumann +2
Treewidth is a fundamental graph invariant that quantifies how tree-like a given graph is. It is extensively used with dynamic programming to design fixed-parameter tractable algor…
Diverse Approximations for Monotone Submodular Maximization Problems with a Matroid Constraint
Anh Viet Do, Mingyu Guo, Aneta Neumann +1
Finding diverse solutions to optimization problems has been of practical interest for several decades, and recently enjoyed increasing attention in research. While submodular optim…
Limited Query Graph Connectivity Test
Mingyu Guo, Jialiang Li, Aneta Neumann +2
We propose a combinatorial optimisation model called Limited Query Graph Connectivity Test. We consider a graph whose edges have two possible states (On/Off). The edges' states are…