Pages that link to "Item:Q762496"

The following pages link to Ramsey numbers and an approximation algorithm for the vertex cover problem (Q762496):

Displaying 40 items.

• An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs (Q290195) (← links)
• Minimum vertex cover in rectangle graphs (Q551504) (← links)
• On approximating minimum vertex cover for graphs with perfect matching (Q557830) (← links)
• A note on approximation of the vertex cover and feedback vertex set problems -- Unified approach (Q671377) (← links)
• Iterative improvement of vertex covers (Q672405) (← links)
• A simple LP-free approximation algorithm for the minimum weight vertex cover problem (Q673599) (← links)
• Approximating the tree and tour covers of a graph (Q688437) (← links)
• Strong and weak edges of a graph and linkages with the vertex cover problem (Q765356) (← links)
• A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem (Q930600) (← links)
• PTAS for connected vertex cover in unit disk graphs (Q1040582) (← links)
• Computing independent sets in graphs with large girth (Q1183338) (← links)
• Approximating maximum independent sets by excluding subgraphs (Q1196452) (← links)
• A unified approximation algorithm for node-deletion problems (Q1270821) (← links)
• Approximating minimum feedback vertex sets in hypergraphs (Q1583598) (← links)
• Approximation for vertex cover in \(\beta\)-conflict graphs (Q1679502) (← links)
• Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number (Q1752485) (← links)
• Approximating the dense set-cover problem (Q1765297) (← links)
• Polynomial approximation algorithms with performance guarantees: an introduction-by-example (Q1771343) (← links)
• Heuristic methods and applications: A categorized survey (Q1823879) (← links)
• Randomized approximation of the stable marriage problem (Q1884845) (← links)
• Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
• A primal-dual approximation algorithm for \textsc{minsat} (Q2161258) (← links)
• Minimum vertex cover in ball graphs through local search (Q2250102) (← links)
• The maximum clique problem in multiple interval graphs (Q2350898) (← links)
• A 2-approximation NC algorithm for connected vertex cover and tree cover (Q2390219) (← links)
• Vertex cover in conflict graphs (Q2424881) (← links)
• Hedging uncertainty: approximation algorithms for stochastic optimization problems (Q2494510) (← links)
• Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation (Q3467859) (← links)
• Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections (Q3557525) (← links)
• Reoptimization of Weighted Graph and Covering Problems (Q3602840) (← links)
• A primal-dual approach to approximation of node-deletion problems for matroidal properties (Q4572003) (← links)
• Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
• Approximating maximum independent sets by excluding subgraphs (Q5056088) (← links)
• Improved Upper Bounds for Partial Vertex Cover (Q5302059) (← links)
• A HYBRID HEURISTIC FOR THE MINIMUM WEIGHT VERTEX COVER PROBLEM (Q5483436) (← links)
• Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph (Q5505664) (← links)
• (Q5874491) (← links)
• (Q5875482) (← links)
• Disjointness graphs of short polygonal chains (Q6144392) (← links)
• Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs (Q6487955) (← links)