Pages that link to "Item:Q1670995"
From MaRDI portal
The following pages link to Covering with clubs: complexity and approximability (Q1670995):
Displaying 5 items.
- A note on the clustered set covering problem (Q496643) (← links)
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
- On the tractability of finding disjoint clubs in a network (Q2422030) (← links)
- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs (Q4899256) (← links)
- Covering a Graph with Clubs (Q5377354) (← links)