Improved complexity for power edge set problem

DOI10.1007/978-3-319-78825-8_11MaRDI QIDQ1642691zbMATH OpenOpenAlexFDO

Authors B. Darties, Annie Chateau, Rodolphe Giroudeau, Matthias Weller

Publication date 15 June 2018

Full work available at URL https://doi.org/10.1007/978-3-319-78825-8_11

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Complexity and lowers bounds for power edge set problem
• Complexity and inapproximability results for the power edge set problem
• New insights for power edge set problem
• Improved algorithms and complexity results for power domination in graphs
• Fundamentals of Computation Theory
• The power edge set problem
• An improved algorithm for parameterized edge dominating set problem
• An improved algorithm for parameterized edge dominating set problem
• Improved approximation algorithms for minimum power covering problems
• Improved approximation algorithms for minimum power covering problems

Cited in

(4)

• The power edge set problem
• New insights for power edge set problem
• Complexity and lowers bounds for power edge set problem
• Complexity and inapproximability results for the power edge set problem

This page was built for publication: Improved complexity for power edge set problem

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