Pages that link to "Item:Q1567492"

The following pages link to The minimum labeling spanning trees (Q1567492):

Displaying 49 items.

• The label cut problem with respect to path length and label frequency (Q313969) (← links)
• Bicriteria path problem minimizing the cost and minimizing the number of labels (Q385462) (← links)
• Computational complexity analysis of the sensor location flow observability problem (Q479256) (← 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)
• A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants (Q716345) (← 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)
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813) (← 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)
• On the minimum label spanning tree problem (Q1567494) (← links)
• Carousel greedy: a generalized greedy algorithm with applications in optimization (Q1652355) (← 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)
• Efficient heuristics for the minimum labeling global cut problem (Q1791898) (← 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)
• Heuristic and exact algorithms for the spanning tree detection problem (Q1885939) (← 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)
• 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)
• Least and most colored bases (Q2381817) (← links)
• Approximation algorithms and hardness results for labeled connectivity problems (Q2426652) (← links)
• Variable neighbourhood search for the \(k\)-labelled spanning forest problem (Q2631224) (← links)
• On the bicriterion - minimal cost/minimal label - spanning tree problem (Q2655606) (← links)
• The rainbow Steiner tree problem (Q2669791) (← links)
• Solving the minimum labelling spanning tree problem using hybrid local search (Q2840755) (← links)
• Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem (Q3439489) (← links)
• The Complexity of Bottleneck Labeled Graph Problems (Q3508579) (← links)
• The complexity for partitioning graphs by monochromatic trees, cycles and paths (Q4652867) (← links)
• Multicriteria path and tree problems: discussion on exact algorithms and applications (Q4918252) (← links)
• Comparison of metaheuristics for the <i>k</i>‐labeled spanning forest problem (Q5278227) (← links)
• Exact algorithms for a discrete metric labeling problem (Q5899363) (← links)
• Reload cost problems: Minimum diameter spanning tree (Q5948962) (← links)
• The complexity of bottleneck labeled graph problems (Q5961969) (← links)
• OMEGA one multi ethnic genetic approach (Q5963233) (← links)
• Finding minimum label spanning trees using cross‐entropy method (Q6065862) (← links)
• Valid inequalities for the \(k\)-color shortest path problem (Q6554645) (← links)