On the Complexity of the Upper r-Tolerant Edge Cover Problem - Topics in Theoretical Computer Science Access content directly
Conference Papers Year : 2020

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

Abstract

We consider the problem of computing edge covers that are tolerant to a certain number of edge deletions. We call the problem of finding a minimum such cover r-Tolerant Edge Cover (r-EC) and the problem of finding a maximum minimal such cover Upper r-EC. We present several NP-hardness and inapproximability results for Upper r-EC and for some of its special cases.
Fichier principal
Vignette du fichier
495613_1_En_3_Chapter.pdf (358.33 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03165379 , version 1 (10-03-2021)

Licence

Attribution

Identifiers

Cite

Ararat Harutyunyan, Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis. On the Complexity of the Upper r-Tolerant Edge Cover Problem. 3rd International Conference on Topics in Theoretical Computer Science (TTCS), Jul 2020, Tehran, Iran. pp.32-47, ⟨10.1007/978-3-030-57852-7_3⟩. ⟨hal-03165379⟩
95 View
19 Download

Altmetric

Share

Gmail Facebook X LinkedIn More