Pages that link to "Item:Q2266936"

The following pages link to Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936):

Displaying 36 items.

• The \(k\)-hop connected dominating set problem: hardness and polyhedra (Q324721) (← links)
• Approximability of the vertex cover problem in power-law graphs (Q385960) (← links)
• Complexity and approximation of the connected set-cover problem (Q453623) (← links)
• Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
• Connected vertex covers in dense graphs (Q974753) (← links)
• Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
• Enumeration and maximum number of minimal connected vertex covers in graphs (Q1678095) (← links)
• The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
• Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547) (← links)
• An efficient heuristic algorithm for solving connected vertex cover problem (Q1720833) (← links)
• Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs (Q1733857) (← links)
• Complexity and algorithms for the connected vertex cover problem in 4-regular graphs (Q1735245) (← links)
• Approximation algorithm for minimum connected 3-path vertex cover (Q2004079) (← links)
• On the approximate compressibility of connected vertex cover (Q2006945) (← links)
• Algorithms and complexity for a class of combinatorial optimization problems with labelling (Q2031932) (← links)
• Reducing graph transversals via edge contractions (Q2037191) (← links)
• Extension and its price for the connected vertex cover problem (Q2072064) (← links)
• Nonseparating independent sets of Cartesian product graphs (Q2300678) (← links)
• Revisiting connected vertex cover: FPT algorithms and lossy kernels (Q2322693) (← links)
• Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
• The connected vertex cover problem in \(k\)-regular graphs (Q2424831) (← links)
• The connected critical node problem (Q2672625) (← links)
• Solving vertex cover in polynomial time on hyperbolic random graphs (Q2701066) (← links)
• Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs (Q3088179) (← links)
• On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators (Q3181057) (← links)
• A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760) (← links)
• Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation (Q3467859) (← links)
• Connected Vertex Covers in Dense Graphs (Q3541785) (← links)
• (Q5075825) (← links)
• (Q5089236) (← links)
• Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5915592) (← links)
• On cycle transversals and their connected variants in the absence of a small linear forest (Q5918178) (← links)
• The balanced connected subgraph problem (Q5918764) (← links)
• Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5919305) (← links)
• Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry (Q6066757) (← links)
• Eternal connected vertex cover problem in graphs: complexity and algorithms (Q6547830) (← links)