An exact algorithm for connected red-blue dominating set

DOI10.1007/978-3-642-13073-1_4zbMATH Open1284.05257OpenAlexW1594618647MaRDI QIDQ3562989FDOQ3562989

Authors: Faisal N. Abu-Khzam, Amer E. Mouawad, Mathieu Liedloff 

Publication date: 28 May 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13073-1_4

Recommendations

• An exact algorithm for connected red-blue dominating set
• Solving Connected Dominating Set Faster Than 2 n
• Solving connected dominating set faster than \(2^n\)
• Graph-Theoretic Concepts in Computer Science
• Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem

zbMATH Keywords

dominating setexact algorithmsweighted Steiner tree

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (2)

• An improved algorithm for the red-blue hitting set problem with the consecutive ones property
• An exact algorithm for connected red-blue dominating set

This page was built for publication: An exact algorithm for connected red-blue dominating set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3562989)