Pages that link to "Item:Q1886801"
From MaRDI portal
The following pages link to Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem (Q1886801):
Displaying 15 items.
- Approximation and hardness results for label cut and related problems (Q630189) (← links)
- Solving the minimum label spanning tree problem by mathematical programming techniques (Q666399) (← links)
- Greedy approximation for the minimum connected dominating set with labeling (Q828691) (← links)
- Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems (Q976011) (← links)
- The labeled maximum matching problem (Q1000970) (← links)
- A mixed integer linear formulation for the minimum label spanning tree problem (Q1025265) (← links)
- Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem (Q1027523) (← links)
- The labeled perfect matching in bipartite graphs (Q1044711) (← links)
- A hybrid metaheuristic for the minimum labeling spanning tree problem (Q1755227) (← links)
- The parameterized complexity of some minimum label problems (Q1959420) (← links)
- Variable neighbourhood search for the minimum labelling Steiner tree problem (Q2267296) (← links)
- A polyhedral approach to the generalized minimum labeling spanning tree problem (Q2329708) (← links)
- Approximation algorithms and hardness results for labeled connectivity problems (Q2426652) (← links)
- On the bicriterion - minimal cost/minimal label - spanning tree problem (Q2655606) (← links)
- Finding minimum label spanning trees using cross‐entropy method (Q6065862) (← links)
