Pages that link to "Item:Q266943"

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

Displaying 3 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)