Pages that link to "Item:Q2817635"

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

Displaying 19 items.

• It is hard to know when greedy is good for finding independent sets (Q286978) (← links)
• Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP (Q293222) (← links)
• The \textsc{max quasi-independent set} problem (Q434194) (← links)
• Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
• Independent sets in bounded-degree hypergraphs (Q1026137) (← links)
• Independent sets in graphs with triangles (Q1349947) (← links)
• Improved approximations for maximum independent set via approximation chains (Q1372278) (← links)
• Analysis of greedy algorithms on graphs with bounded degrees (Q1417582) (← links)
• Optimizing adiabatic quantum program compilation using a graph-theoretic framework (Q1654155) (← links)
• Derandomized graph products (Q1842777) (← links)
• Greed is good for deterministic scale-free networks (Q2205637) (← links)
• Minimum Entropy Combinatorial Optimization Problems (Q3576040) (← links)
• Improved approximations of independent sets in bounded-degree graphs via subgraph removal (Q4698692) (← links)
• Improved approximations of independent sets in bounded-degree graphs (Q5054761) (← links)
• On approximation properties of the Independent set problem for degree 3 graphs (Q5057456) (← links)
• Ultimate greedy approximation of independent sets in subcubic graphs (Q5146864) (← links)
• Greedy approximations of independent sets in low degree graphs (Q6487957) (← links)
• Stackelberg strategies on epidemic containment games (Q6535824) (← links)
• Ultimate greedy approximation of independent sets in subcubic graphs (Q6623597) (← links)