Pages that link to "Item:Q2390219"
From MaRDI portal
The following pages link to A 2-approximation NC algorithm for connected vertex cover and tree cover (Q2390219):
Displayed 6 items.
- Connected vertex covers in dense graphs (Q974753) (← links)
- PTAS for connected vertex cover in unit disk graphs (Q1040582) (← links)
- Parameterized measure \& conquer for problems with no small kernels (Q1759684) (← links)
- Enumerate and Measure: Improving Parameter Budget Management (Q3058690) (← links)
- Connected Vertex Covers in Dense Graphs (Q3541785) (← links)
- Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph (Q5505664) (← links)
