Pages that link to "Item:Q2008557"
From MaRDI portal
The following pages link to Approximation algorithms for minimum weight connected 3-path vertex cover (Q2008557):
Displaying 16 items.
- Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943) (← links)
- On the weighted \(k\)-path vertex cover problem (Q406316) (← links)
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
- A faster FPT algorithm for 3-path vertex cover (Q903365) (← links)
- On approximability of connected path vertex cover (Q1644919) (← links)
- Approximation algorithm for minimum connected 3-path vertex cover (Q2004079) (← links)
- Improved approximation algorithms for path vertex covers in regular graphs (Q2006949) (← links)
- A multi-start iterated greedy algorithm for the minimum weight vertex cover \(P_3\) problem (Q2008933) (← 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)
- An improved approximation algorithm for the minimum 3-path partition problem (Q2424798) (← links)
- Approximation algorithm for the minimum weight connected \(k\)-subgraph cover problem (Q2447765) (← links)
- A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs (Q2512658) (← links)
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
- The <i>k</i>‐path vertex cover: General bounds and chordal graphs (Q6087563) (← links)
- Computing connected-\(k\)-subgraph cover with connectivity requirement (Q6111948) (← links)
