Pages that link to "Item:Q1644919"
From MaRDI portal
The following pages link to On approximability of connected path vertex cover (Q1644919):
Displaying 12 items.
- Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943) (← links)
- Two fixed-parameter algorithms for vertex covering by paths on trees (Q963337) (← links)
- PTAS for connected vertex cover in unit disk graphs (Q1040582) (← links)
- Covering a graph with nontrivial vertex-disjoint paths: existence and optimization (Q1627174) (← links)
- Approximation algorithm for minimum connected 3-path vertex cover (Q2004079) (← links)
- Approximation algorithms for minimum weight connected 3-path vertex cover (Q2008557) (← links)
- Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs (Q2193275) (← links)
- Approximation algorithm for minimum weight connected-\(k\)-subgraph cover (Q2197543) (← links)
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
- Vertex Cover Gets Faster and Harder on Low Degree Graphs (Q2920457) (← links)
- Approximating V<scp>ertex</scp> C<scp>over</scp> using Structural Rounding (Q5147498) (← links)
- Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5915592) (← links)
