Complexity and lowers bounds for Power Edge Set Problem

Document type :
Journal articles
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01950398
Contributor : Isabelle Gouat <>
Submitted on : Monday, December 10, 2018 - 6:10:47 PM
Last modification on : Tuesday, April 2, 2019 - 2:39:57 AM

Identifiers

Citation

Benoit Darties, Nicolas Champseix, Annie Chateau, Rodolphe Giroudeau, Mathias Weller. Complexity and lowers bounds for Power Edge Set Problem. Journal of Discrete Algorithms, Elsevier, 2018, 52-53, pp.70-91. ⟨10.1016/j.jda.2018.11.006⟩. ⟨lirmm-01950398⟩

Share

Metrics

Record views

122