On the Complexity of the Upper r-Tolerant Edge Cover Problem - Topics in Theoretical Computer Science
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.

Domains

Computer Science [cs]
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)

Hal Ifip  : Connect in order to contact the contributor

https://inria.hal.science/hal-03165379

Submitted on : Wednesday, March 10, 2021-4:05:05 PM

Last modification on : Sunday, September 29, 2024-9:49:53 PM

Long-term archiving on : Friday, June 11, 2021-7:06:19 PM

Download

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS UNIV-DAUPHINE IFIP-LNCS IFIP LAMSADE-DAUPHINE IFIP-TC IFIP-TC1 PSL IFIP-LNCS-12281
118 View
39 Download

Altmetric

Share

More