Pages that link to "Item:Q2931950"

The following pages link to A 2-approximation algorithm for the vertex cover<i>P</i>₄problem in cubic graphs (Q2931950):

Displayed 12 items.

• Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943) ‎ (← links)
• PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602) ‎ (← links)
• A faster FPT algorithm for 3-path vertex cover (Q903365) ‎ (← links)
• An FPT algorithm for the vertex cover \(P_4\) problem (Q906446) ‎ (← links)
• PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) ‎ (← links)
• Approximation algorithm for minimum connected 3-path vertex cover (Q2004079) ‎ (← links)
• Approximation algorithms for minimum weight connected 3-path vertex cover (Q2008557) ‎ (← links)
• Algorithm for online 3-path vertex cover (Q2300630) ‎ (← links)
• Approximation algorithm for the minimum weight connected \(k\)-subgraph cover problem (Q2447765) ‎ (← links)
• Approximation Algorithm for the Minimum Connected $$k$$-Path Vertex Cover Problem (Q2942448) ‎ (← links)
• König Graphs with Respect to the 4-Path and Its Spanning Supergraphs (Q4973244) ‎ (← links)
• (Q5225203) ‎ (← links)