Pages that link to "Item:Q3976603"
From MaRDI portal
The following pages link to A heuristic approach to the vertex cover problem (Q3976603):
Displaying 10 items.
- Ad hoc heuristic for the cover printing problem (Q435726) (← links)
- An edge-reduction algorithm for the vertex cover problem (Q833573) (← links)
- A graph approximation heuristic for the vertex cover problem on planar graphs (Q1328583) (← links)
- An experimental comparison of three heuristics for the WVCP (Q1328615) (← links)
- Bidirectional evolutionary heuristic for the minimum vertex-cover problem (Q1429748) (← links)
- Experimental analysis of Heuristic algorithms for the dominating set problem (Q1600994) (← links)
- An efficient heuristic algorithm for solving connected vertex cover problem (Q1720833) (← links)
- Minimum vertex covering problem based on the shortest path algorithm (Q3461753) (← links)
- A note on a parallel heuristic for minimum vertex cover (Q3971267) (← links)
- (Q5420473) (← links)