Pages that link to "Item:Q1853118"

The following pages link to A note on the minimum label spanning tree. (Q1853118):

Displaying 17 items.

• 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)
• Local search for the minimum label spanning tree problem with bounded color classes. (Q1811627) (← links)
• Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem (Q1886801) (← links)
• The parameterized complexity of some minimum label problems (Q1959420) (← links)
• Algorithms and complexity for a class of combinatorial optimization problems with labelling (Q2031932) (← 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)
• Least and most colored bases (Q2381817) (← links)
• Approximation algorithms and hardness results for labeled connectivity problems (Q2426652) (← links)
• On the bicriterion - minimal cost/minimal label - spanning tree problem (Q2655606) (← links)