On the Complexity of the Upper r-Tolerant Edge Cover Problem

Ararat Harutyunyan, Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis. On the Complexity of the Upper r-Tolerant Edge Cover Problem. In Luís Soares Barbosa, Mohammad Ali Abam, editors, Topics in Theoretical Computer Science - Third IFIP WG 1.8 International Conference, TTCS 2020, Tehran, Iran, July 1-2, 2020, Proceedings. Volume 12281 of Lecture Notes in Computer Science, pages 32-47, Springer, 2020. [doi]

@inproceedings{HarutyunyanGMMP20,
  title = {On the Complexity of the Upper r-Tolerant Edge Cover Problem},
  author = {Ararat Harutyunyan and Mehdi Khosravian Ghadikolaei and Nikolaos Melissinos and Jérôme Monnot and Aris Pagourtzis},
  year = {2020},
  doi = {10.1007/978-3-030-57852-7_3},
  url = {https://doi.org/10.1007/978-3-030-57852-7_3},
  researchr = {https://researchr.org/publication/HarutyunyanGMMP20},
  cites = {0},
  citedby = {0},
  pages = {32-47},
  booktitle = {Topics in Theoretical Computer Science - Third IFIP WG 1.8 International Conference, TTCS 2020, Tehran, Iran, July 1-2, 2020, Proceedings},
  editor = {Luís Soares Barbosa and Mohammad Ali Abam},
  volume = {12281},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-57852-7},
}