Pages that link to "Item:Q286978"
From MaRDI portal
The following pages link to It is hard to know when greedy is good for finding independent sets (Q286978):
Displayed 4 items.
- Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP (Q293222) (← links)
- Optimal monotone relabelling of partially non-monotone ordinal data (Q2885460) (← links)
- Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP (Q3374757) (← links)
- Recognizing well-dominated graphs is coNP-complete (Q6072202) (← links)