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):
Displayed 4 items.
- 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)
- Approximation algorithms and hardness results for labeled connectivity problems (Q2426652) (← links)