Pages that link to "Item:Q1811627"

The following pages link to Local search for the minimum label spanning tree problem with bounded color classes. (Q1811627):

Displaying 26 items.

• Computational complexity analysis of the sensor location flow observability problem (Q479256) (← links)
• A note on the clustered set covering problem (Q496643) (← 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)
• On the hardness of labeled correlation clustering problem: a parameterized complexity view (Q896155) (← 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)
• 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)
• Local approximations for maximum partial subgraph problem. (Q1426723) (← links)
• On the minimum label spanning tree problem (Q1567494) (← links)
• A hybrid metaheuristic for the minimum labeling spanning tree problem (Q1755227) (← 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 results for labeled correlation clustering problem (Q2253964) (← links)
• Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
• A polyhedral approach to the generalized minimum labeling spanning tree problem (Q2329708) (← links)
• Approximate tradeoffs on weighted labeled matroids (Q2341761) (← links)
• Approximation algorithms and hardness results for labeled connectivity problems (Q2426652) (← links)
• Solving the minimum labelling spanning tree problem using hybrid local search (Q2840755) (← links)
• The Complexity of Bottleneck Labeled Graph Problems (Q3508579) (← links)
• Comparison of metaheuristics for the <i>k</i>‐labeled spanning forest problem (Q5278227) (← links)
• The complexity of bottleneck labeled graph problems (Q5961969) (← links)