Pages that link to "Item:Q3971267"
From MaRDI portal
The following pages link to A note on a parallel heuristic for minimum vertex cover (Q3971267):
Displaying 7 items.
- A parallel algorithm for the minimum weighted vertex cover problem (Q674187) (← links)
- Solving NP-hard problems in 'almost trees': vertex cover (Q1062757) (← links)
- Parallel and serial heuristics for the minimum set cover problem (Q1186830) (← links)
- An experimental comparison of three heuristics for the WVCP (Q1328615) (← links)
- A parallel circle-cover minimization algorithm (Q1823682) (← links)
- A 2-approximation NC algorithm for connected vertex cover and tree cover (Q2390219) (← links)
- Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP (Q3374757) (← links)