Covering with clubs: complexity and approximability

DOI10.1007/978-3-319-94667-2_13OpenAlexW2806095013WikidataQ62678523 ScholiaQ62678523MaRDI QIDQ1670995

Italo Zoppis, Giancarlo Mauri, Riccardo Dondi, Florian Sikora

Publication date: 6 September 2018

Full work available at URL: https://arxiv.org/abs/1806.01119

Mathematics Subject Classification ID

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

Related Items (3)

On the tractability of finding disjoint clubs in a network ⋮ Covering a Graph with Clubs ⋮ On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs

This page was built for publication: Covering with clubs: complexity and approximability