2 papers
cs.DC2024
Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion
Christoph Lenzen, Sophie Wenning
A long-standing open question is which graph class is the most general one permitting constant-time constant-factor approximations for dominating sets. The approximation ratio has…
cs.DC2024
Model-Agnostic Approximation of Constrained Forest Problems
Corinna Coupette, Alipasha Montaseri, Christoph Lenzen
Constrained Forest Problems (CFPs) as introduced by Goemans and Williamson in 1995 capture a wide range of network design problems with edge subsets as solutions, such as Minimum S…