Pages that link to "Item:Q503602"
From MaRDI portal
The following pages link to PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602):
Displaying 6 items.
- 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)
- Vertex cover at distance on \(H\)-free graphs (Q2115860) (← links)
- Approximation algorithm for minimum weight connected-\(k\)-subgraph cover (Q2197543) (← links)
- (Q5225203) (← links)
