Pages that link to "Item:Q2962573"
From MaRDI portal
The following pages link to Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function (Q2962573):
Displaying 12 items.
- An order-based algorithm for minimum dominating set with application in graph mining (Q781288) (← links)
- New heuristic approaches for maximum balanced biclique problem (Q781924) (← links)
- Solving the set packing problem via a maximum weighted independent set heuristic (Q826368) (← links)
- The weighted independent domination problem: integer linear programming models and metaheuristic approaches (Q1681137) (← links)
- A polynomial-time approximation to a minimum dominating set in a graph (Q2166772) (← links)
- An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem (Q2302299) (← links)
- Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism (Q2680785) (← links)
- A novel local search algorithm with configuration checking and scoring mechanism for the set <i>k</i>‐covering problem (Q4601636) (← links)
- Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set (Q4989343) (← links)
- MLQCC: an improved local search algorithm for the set <i>k</i>‐covering problem (Q6088120) (← links)
- An efficient local search algorithm for minimum positive influence dominating set problem (Q6109569) (← links)
