„Partial Dominating Set“

Suchergebnisse

6 Treffer

• Solving Partial Dominating Set and Related Problems Using Twin-Width
  Balabán, Jakub ; Mock, Daniel ; Rossmanith, Peter 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• SubModST: A Fast Generic Solver for Submodular Maximization with Size Constraints
  Woydt, Henning ; Komusiewicz, Christian ; Sommer, Frank 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract)
  Amini, Omid ; Fomin, Fedor ; Saurabh, Saket 2008 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximation algorithm for the minimum partial connected Roman dominating set problem
  Zhang, Yaoyao ; Zhang, Zhao ; Du, Ding-Zhu
• On Dominating Graph of Graphs, Median Graphs, Partial Cubes and Complement of Minimal Dominating Sets
  Mofidi, Alireza
• The first constant factor approximation for minimum partial connected dominating set problem in growth-bounded graphs
  Liu, Xianliang ; Wang, Wei ; Kim, Donghyun ; Yang, Zishen ; Tokuta, Alade O. ; Jiang, Yaolin