On the complexity of the upper r-tolerant edge cover problem

DOI10.1007/978-3-030-57852-7_3MaRDI QIDQ1997258zbMATH OpenOpenAlexFDO

Authors Ararat Harutyunyan, Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis

Publication date 1 March 2021

Full work available at URL https://doi.org/10.1007/978-3-030-57852-7_3

zbMATH Keywords

matchingNP-completenessapproximabilityupper edge cover

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• scientific article; zbMATH DE number 1708169 (Why is no real title available?)
• Test collection based evaluation of information retrieval systems

Cited in

(4)

• Algorithmic aspects of upper edge domination
• (In)approximability of maximum minimal FVS
• Extension of some edge graph problems: standard, parameterized and approximation complexity
• In)approximability of Maximum Minimal FVS

This page was built for publication: On the complexity of the upper \(r\)-tolerant edge cover problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1997258)