The following pages link to Greed is good (Q2817635):
Displaying 11 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)
- Independent sets in graphs with triangles (Q1349947) (← links)
- Improved approximations for maximum independent set via approximation chains (Q1372278) (← 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 (Q5054761) (← links)
- On approximation properties of the Independent set problem for degree 3 graphs (Q5057456) (← links)