Covering with clubs: complexity and approximability

DOI10.1007/978-3-319-94667-2_13MaRDI QIDQ1670995zbMATH OpenOpenAlexWikidataFDO

Authors Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis

Publication date 6 September 2018

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

Mathematics Subject Classification ID

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

Recommendations

• Covering a graph with clubs
• On the tractability of finding disjoint clubs in a network
• Cliques and clubs
• Algorithms for the maximum k-club problem in graphs
• Approximation Algorithms for the k-Clique Covering Problem

Cited in

(8)

• On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs
• On the tractability of finding disjoint clubs in a network
• Optimal approximation algorithms for maximum distance-bounded subgraph problems
• Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
• A note on the clustered set covering problem
• Covering a graph with clubs
• On the tractability of covering a graph with 2-clubs
• On the tractability of covering a graph with 2-clubs

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

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