Pages that link to "Item:Q1567494"

The following pages link to On the minimum label spanning tree problem (Q1567494):

Displaying 44 items.

• Traveling salesman problems in temporal graphs (Q284573) (← links)
• Labeled cuts in graphs (Q313962) (← links)
• The label cut problem with respect to path length and label frequency (Q313969) (← links)
• The maximum labeled path problem (Q527429) (← links)
• 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)
• Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates (Q846172) (← links)
• Discrete particle swarm optimization for the minimum labelling Steiner tree problem (Q968390) (← 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 new approach for the multiobjective minimum spanning tree (Q1651644) (← links)
• Carousel greedy: a generalized greedy algorithm with applications in optimization (Q1652355) (← links)
• Secluded connectivity problems (Q1679225) (← links)
• Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem (Q1702134) (← links)
• On the complexity of rainbow spanning forest problem (Q1749772) (← links)
• A hybrid metaheuristic for the minimum labeling spanning tree problem (Q1755227) (← links)
• The rainbow spanning forest problem (Q1797922) (← links)
• Local search for the minimum label spanning tree problem with bounded color classes. (Q1811627) (← links)
• A note on the minimum label spanning tree. (Q1853118) (← links)
• Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem (Q1886801) (← links)
• Labeled traveling salesman problems: complexity and approximation (Q1952507) (← 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)
• Complexity and approximation results on the shared transportation problem (Q2149862) (← links)
• Two heuristics for the rainbow spanning forest problem (Q2184043) (← links)
• Minimum label \(s\)-\(t\) cut has large integrality gaps (Q2216106) (← 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)
• Approximate tradeoffs on weighted labeled matroids (Q2341761) (← 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)
• Solving the minimum labelling spanning tree problem using hybrid local search (Q2840755) (← links)
• Sequence Hypergraphs (Q3181065) (← links)
• An Introduction to Temporal Graphs: An Algorithmic Perspective (Q3464477) (← links)
• Comparison of metaheuristics for the <i>k</i>‐labeled spanning forest problem (Q5278227) (← links)
• An Introduction to Temporal Graphs: An Algorithmic Perspective^* (Q5856438) (← links)
• Reload cost problems: Minimum diameter spanning tree (Q5948962) (← links)
• OMEGA one multi ethnic genetic approach (Q5963233) (← links)
• New algorithms for the minimum coloring cut problem (Q6066619) (← links)