Pages that link to "Item:Q266943"

The following pages link to Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943):

Displaying 9 items.

• PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602) (← links)
• A simpler PTAS for connected \(k\)-path vertex cover in homogeneous wireless sensor network (Q724732) (← 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)
• 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)
• 3-path vertex cover and dissociation number of hexagonal graphs (Q5866250) (← links)
• The <i>k</i>‐path vertex cover: General bounds and chordal graphs (Q6087563) (← links)