Skip to main content
SpringerLink
Log in

New Insights for Power Edge Set Problem

  • Conference paper
  • First Online:
Combinatorial Optimization and Applications (COCOA 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10627))

Abstract

We study the computational complexity of Power Edge Set (PES), for restricted graph classes with degree bounded by three (bipartite graph, Unit disk graphs and Grid graphs). This problem is devoted to the monitoring of an electric network. The aim is to minimize the number of edge-allocated PMUs in a network such that all vertices are monitored according to two spreading rules. We improve known complexity results using an L-reduction. We also derive some lowers bounds according to classic complexity hypothesis (\(\mathcal {P} \ne \mathcal {NP}\), \(\mathcal {UGC}\), \(\mathcal {ETH}\)).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Austrin, P., Khot, S., Safra, M.: Inapproximability of vertex cover and independent set in bounded degree graphs. In: Proceedings of the Annual IEEE Conference on Computational Complexity, pp. 74–80 (2009)

    Google Scholar 

  2. Darties, B., Chateau, A., Giroudeau, R., Weller, M.: Improved complexity for power edge set problem. In: 28th International Workshop on Combinatorial Algorithms (2017)

    Google Scholar 

  3. Dorfling, M., Henning, M.: A note on power domination in grid graphs. Discr. Appl. Math. 154(6), 1023–1027 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  4. Feige, U.: Vertex cover is hardest to approximate on regular graphs. Technical report MCS03-15, the Weizmann Institute (2003)

    Google Scholar 

  5. Gou, B.: Generalized integer linear programming formulation for optimal PMU placement. IEEE Trans. Power Syst. 23(3), 1099–1104 (2008)

    Article  Google Scholar 

  6. Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T., Henning, M.A.: Domination in graphs applied to electric power networks. SIAM J. Discr. Math. 15(4), 519–529 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  7. Impagliazzo, R., Paturi, R.: On the complexity of \(k\)-SAT. J. Comput. Syst. Sci. 62(2), 367–375 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  8. Li, Y., Thai, M.T., Wang, F., Yi, C., Wan, P., Du, D.: On greedy construction of connected dominating sets in wireless networks. Wirel. Commun. Mobile Comput. 5(8), 927–932 (2005)

    Article  Google Scholar 

  9. Lokshtanov, D., Marx, D., Saurabh, S.: Lower bounds based on the exponential time hypothesis. Bull. EATCS 105, 41–72 (2011)

    MATH  MathSciNet  Google Scholar 

  10. Papadimitriou, C., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43(3), 425–440 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  11. Poirion, P., Toubaline, S., D’Ambrosio, C., Liberti, L.: The power edge set problem. Networks 68(2), 104–120 (2016)

    Article  MathSciNet  Google Scholar 

  12. Radwan, A.: A new algorithm for orthogonal drawings of 3-planar graphs. Int. J. Appl. Math. 6(3), 301–317 (2001)

    MATH  MathSciNet  Google Scholar 

  13. Simonetti, L., Salles da Cunha, A., Lucena, A.: The minimum connected dominating set problem: formulation, valid inequalities and a branch-and-cut algorithm. In: Pahl, J., Reiners, T., Voß, S. (eds.) INOC 2011. LNCS, vol. 6701, pp. 162–169. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-21527-8_21

    Chapter  Google Scholar 

  14. Thai, M.T., Du, D.Z.: Connected dominating sets in disk graphs with bidirectional links. IEEE Commun. Lett. 10(3), 138–140 (2006)

    Article  Google Scholar 

  15. Toubaline, S., Poirion, P.-L., D’Ambrosio, C., Liberti, L.: Observing the state of a smart grid using bilevel programming. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 364–376. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-26626-8_27

    Chapter  Google Scholar 

  16. Yuill, W., Edwards, A., Chowdhury, S., Chowdhury, S.P.: Optimal PMU placement: a comprehensive literature review. In: 2011 IEEE Power and Energy Society General Meeting, pp. 1–8, July 2011

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Le2i FRE2005, CNRS, Arts et Métiers, Univ. Bourgogne Franche-Comté, Dijon, France

    Benoit Darties

  2. LIRMM - CNRS UMR 5506, Montpellier, France

    Annie Chateau, Rodolphe Giroudeau & Mathias Weller

Authors
  1. Benoit Darties
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Annie Chateau
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rodolphe Giroudeau
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mathias Weller
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Annie Chateau .

Editor information

Editors and Affiliations

  1. Shanghai Jiao Tong University, Shanghai, China

    Xiaofeng Gao

  2. Harbin Institute of Technology, Shenzhen, China

    Hongwei Du

  3. Kennesaw State University, Kennesaw, Georgia, USA

    Meng Han

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Darties, B., Chateau, A., Giroudeau, R., Weller, M. (2017). New Insights for Power Edge Set Problem. In: Gao, X., Du, H., Han, M. (eds) Combinatorial Optimization and Applications. COCOA 2017. Lecture Notes in Computer Science(), vol 10627. Springer, Cham. https://doi.org/10.1007/978-3-319-71150-8_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-71150-8_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-71149-2

  • Online ISBN: 978-3-319-71150-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation