Pages that link to "Item:Q1171390"

The following pages link to Depth-first search and the vertex cover problem (Q1171390):

Displaying 32 items.

• Multi-rooted greedy approximation of directed Steiner trees with applications (Q262265) (← links)
• The simultaneous strong metric dimension of graph families (Q726509) (← links)
• On approximation problems related to the independent set and vertex cover problems (Q760210) (← links)
• Connected vertex covers in dense graphs (Q974753) (← links)
• Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
• PTAS for connected vertex cover in unit disk graphs (Q1040582) (← links)
• Equivalent approximation algorithms for node cover (Q1077934) (← links)
• Maximum weight independent set in trees (Q1101239) (← links)
• On approximation algorithms for the minimum satisfiability problem (Q1351157) (← links)
• On approximability of the independent/connected edge dominating set problems (Q1603390) (← links)
• On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
• Approximation for vertex cover in \(\beta\)-conflict graphs (Q1679502) (← links)
• An efficient heuristic algorithm for solving connected vertex cover problem (Q1720833) (← links)
• Complexity and algorithms for the connected vertex cover problem in 4-regular graphs (Q1735245) (← links)
• On the approximate compressibility of connected vertex cover (Q2006945) (← links)
• Extension and its price for the connected vertex cover problem (Q2072064) (← links)
• Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs (Q2178334) (← links)
• Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
• A 2-approximation NC algorithm for connected vertex cover and tree cover (Q2390219) (← links)
• The connected vertex cover problem in \(k\)-regular graphs (Q2424831) (← links)
• Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP (Q2429346) (← links)
• A primal-dual method for approximating tree cover with two weights (Q2465937) (← links)
• \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
• Safe Approximation and Its Relation to Kernelization (Q2891346) (← links)
• A Primal-Dual Method for Approximating Tree Cover with Two Weights (Q3439142) (← links)
• Complexity and Approximation Results for the Connected Vertex Cover Problem (Q3508568) (← links)
• Connected Vertex Covers in Dense Graphs (Q3541785) (← links)
• An Articulation Point-Based Approximation Algorithm for Minimum Vertex Cover Problem (Q5038340) (← links)
• Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph (Q5505664) (← links)
• On Approximating (Connected) 2-Edge Dominating Set by a Tree (Q5740184) (← links)
• Approximate Turing Kernelization for Problems Parameterized by Treewidth (Q5874531) (← links)
• (Q6179658) (← links)