Pages that link to "Item:Q1944113"

The following pages link to A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem (Q1944113):

Displaying 40 items.

• Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943) (← links)
• Kernelization of the 3-path vertex cover problem (Q279214) (← links)
• On the weighted \(k\)-path vertex cover problem (Q406316) (← links)
• A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591) (← links)
• PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602) (← links)
• Approximate association via dissociation (Q505447) (← links)
• A PTAS for minimum weighted connected vertex cover \(P_3\) problem in 3-dimensional wireless sensor networks (Q512868) (← links)
• A simpler PTAS for connected \(k\)-path vertex cover in homogeneous wireless sensor network (Q724732) (← links)
• A faster FPT algorithm for 3-path vertex cover (Q903365) (← links)
• Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← links)
• An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs (Q1630923) (← links)
• PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
• Efficient algorithm for the vertex cover \(P_k\) problem on cacti (Q1739987) (← links)
• Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145) (← links)
• Approximation algorithm for minimum connected 3-path vertex cover (Q2004079) (← links)
• Approximation algorithms for minimum weight connected 3-path vertex cover (Q2008557) (← links)
• A multi-start iterated greedy algorithm for the minimum weight vertex cover \(P_3\) problem (Q2008933) (← links)
• On a relation between \(k\)-path partition and \(k\)-path vertex cover (Q2030433) (← links)
• Approximation algorithms for hitting subgraphs (Q2115875) (← 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)
• Kernels for packing and covering problems (Q2272393) (← links)
• Algorithm for online 3-path vertex cover (Q2300630) (← links)
• Partitioning a graph into small pieces with applications to path transversal (Q2316611) (← links)
• The \(k\)-path vertex cover in Cartesian product graphs and complete bipartite graphs (Q2333163) (← links)
• The \(k\)-path vertex cover of rooted product graphs (Q2348061) (← links)
• PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs (Q2392763) (← links)
• On the vertex cover \(P_3\) problem parameterized by treewidth (Q2410093) (← links)
• The vertex cover \(P_3\) problem in cubic graphs (Q2444740) (← links)
• On the vertex \(k\)-path cover (Q2446837) (← links)
• Approximation algorithm for the minimum weight connected \(k\)-subgraph cover problem (Q2447765) (← links)
• A 2-approximation algorithm for the vertex cover<i>P</i>₄problem in cubic graphs (Q2931950) (← links)
• Approximation Algorithm for the Minimum Connected $$k$$-Path Vertex Cover Problem (Q2942448) (← links)
• A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion (Q3196407) (← links)
• The k-Observer Problem on d-regular Graphs (Q5207902) (← links)
• (Q5225203) (← links)
• Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
• Approximating Bounded Degree Deletion via Matroid Matching (Q5283370) (← 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)