Pages that link to "Item:Q1015327"
From MaRDI portal
The following pages link to Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers (Q1015327):
Displaying 14 items.
- Construction of optimal constant-dimension subspace codes (Q281823) (← links)
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
- Approximating the maximum vertex/edge weighted clique using local search (Q1009183) (← links)
- A hybrid iterated local search heuristic for the maximum weight independent set problem (Q1749784) (← links)
- An efficient local search framework for the minimum weighted vertex cover problem (Q2282264) (← links)
- Subgraph extraction and metaheuristics for the maximum clique problem (Q2359135) (← links)
- Phased local search for the maximum clique problem (Q2369988) (← links)
- New Lower Bounds for Binary Constant-Dimension Subspace Codes (Q4643732) (← links)
- The maximum volume hard subset model for Poisson processes: simulation aspects (Q4913932) (← links)
- An Efficient Local Search for the Minimum Independent Dominating Set Problem (Q5140723) (← links)
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765) (← links)
- (Q5184941) (← links)
- On locally optimal independent sets and vertex covers (Q5687646) (← links)
- An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem† (Q6066584) (← links)