Extension and its price for the Connected Vertex Cover problem

DOI10.1007/978-3-030-25005-8_26OpenAlexW2961777252MaRDI QIDQ2301752

Nikolaos Melissinos, Mehdi Khosravian Ghadikoalei, Aris Pagourtzis, Jérôme Monnot

Publication date: 25 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-25005-8_26

zbMATH Keywords

NP-completenessapproximation algorithmsspecial graph classesextension problemsconnected vertex coverprice of extensionupper connected vertex cover

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (3)

Invited talks ⋮ Can local optimality be used for efficient data reduction? ⋮ On the complexity of solution extension of optimization problems

This page was built for publication: Extension and its price for the Connected Vertex Cover problem