Pages that link to "Item:Q679458"

The following pages link to Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458):

Displaying 43 items.

• A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
• Computing convex quadrangulations (Q412380) (← links)
• Bounding the feedback vertex number of digraphs in terms of vertex degrees (Q534359) (← links)
• On approximating minimum vertex cover for graphs with perfect matching (Q557830) (← links)
• Minimum entropy combinatorial optimization problems (Q693045) (← links)
• On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
• Filtering algorithms for the NValue constraint (Q857887) (← links)
• Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover (Q867859) (← links)
• Explore and repair graphs with black holes using mobile entities (Q888441) (← links)
• A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs (Q987802) (← links)
• Independent sets in bounded-degree hypergraphs (Q1026137) (← links)
• Approximation algorithms for the weighted independent set problem in sparse graphs (Q1028454) (← links)
• Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket (Q1704581) (← links)
• A note on greedy algorithms for the maximum weighted independent set problem (Q1861582) (← links)
• Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
• Approximability of open \(k\)-monopoly problems (Q2048211) (← links)
• Maximum 0-1 timed matching on temporal graphs (Q2161255) (← links)
• New potential functions for greedy independence and coloring (Q2255044) (← links)
• On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
• The complexity of dissociation set problems in graphs (Q2275943) (← links)
• Combinatorial properties of Farey graphs (Q2333787) (← links)
• Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem (Q2453730) (← links)
• A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
• Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs (Q2958319) (← links)
• Recoverable Values for Independent Sets (Q3012827) (← links)
• Vertex Cover in Graphs with Locally Few Colors (Q3012828) (← links)
• GreedyMAX-type Algorithms for the Maximum Independent Set Problem (Q3075512) (← links)
• Solving maximum independent set by asynchronous distributed hopfield-type neural networks (Q3431447) (← links)
• Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections (Q3557525) (← links)
• (Q3980035) (← links)
• Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation (Q4809670) (← links)
• A Generalization of Spatial Monte Carlo Integration (Q5004340) (← links)
• Verified Approximation Algorithms (Q5049009) (← links)
• (Q5094121) (← links)
• A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs (Q5266610) (← links)
• Generalizing Geometric Graphs (Q5895515) (← links)
• On the maximum edge-pair embedding bipartite matching (Q5918365) (← links)
• Simple and local independent set approximation (Q5919021) (← links)
• An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem† (Q6066584) (← links)
• Improved (In-)Approximability Bounds for d-Scattered Set (Q6107026) (← links)
• Ultimate greedy approximation of independent sets in subcubic graphs (Q6623597) (← links)
• Greedy heuristic guided by lexicographic excellence (Q6635980) (← links)
• Approximation ratio of the min-degree greedy algorithm for maximum independent set on interval and chordal graphs (Q6648269) (← links)