Pages that link to "Item:Q1635712"
From MaRDI portal
The following pages link to Optimal approximation algorithms for maximum distance-bounded subgraph problems (Q1635712):
Displayed 7 items.
- Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments (Q1719617) (← links)
- Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity (Q2025099) (← links)
- Parsimonious formulations for low-diameter clusters (Q2220903) (← links)
- Approximating maximum diameter-bounded subgraph in unit disk graphs (Q2665266) (← links)
- On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
- Covering a Graph with Clubs (Q5377354) (← links)
- On the tractability of covering a graph with 2-clubs (Q5925691) (← links)