On the minimum label spanning tree problem
From MaRDI portal
Publication:1567494
DOI10.1016/S0020-0190(98)00034-9zbMATH Open0938.90064MaRDI QIDQ1567494FDOQ1567494
Publication date: 20 June 2000
Published in: Information Processing Letters (Search for Journal in Brave)
Recommendations
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Cites Work
Cited In (50)
- Sequence Hypergraphs: Paths, Flows, and Cuts
- On the shared transportation problem: computational hardness and exact approach
- Least and most colored bases
- Greedy approximation for the minimum connected dominating set with labeling
- Discrete particle swarm optimization for the minimum labelling Steiner tree problem
- A note on the minimum label spanning tree.
- Traveling salesman problems in temporal graphs
- On Labeled Traveling Salesman Problems
- A hybrid metaheuristic for the minimum labeling spanning tree problem
- OMEGA one multi ethnic genetic approach
- Labeled traveling salesman problems: complexity and approximation
- On the complexity of rainbow spanning forest problem
- An Introduction to Temporal Graphs: An Algorithmic Perspective*
- The rainbow spanning forest problem
- The labeled maximum matching problem
- Approximate tradeoffs on weighted labeled matroids
- The labeled perfect matching in bipartite graphs
- Labeled cuts in graphs
- The label cut problem with respect to path length and label frequency
- Complexity and approximation results on the shared transportation problem
- Finding minimum label spanning trees using cross‐entropy method
- Carousel greedy: a generalized greedy algorithm with applications in optimization
- A new approach for the multiobjective minimum spanning tree
- On the bicriterion - minimal cost/minimal label - spanning tree problem
- New algorithms for the minimum coloring cut problem
- Solving the minimum labelling spanning tree problem using hybrid local search
- Two heuristics for the rainbow spanning forest problem
- The Complexity of Bottleneck Labeled Graph Problems
- Title not available (Why is that?)
- Comparison of metaheuristics for the k‐labeled spanning forest problem
- Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems
- Sequence Hypergraphs
- The parameterized complexity of some minimum label problems
- Reload cost problems: Minimum diameter spanning tree
- Secluded connectivity problems
- Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem
- A polyhedral approach to the generalized minimum labeling spanning tree problem
- Variable neighbourhood search for the minimum labelling Steiner tree problem
- Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem
- An Introduction to Temporal Graphs: An Algorithmic Perspective
- Local search for the minimum label spanning tree problem with bounded color classes.
- Solving the minimum label spanning tree problem by mathematical programming techniques
- Approximation algorithms and hardness results for labeled connectivity problems
- Approximation and hardness results for label cut and related problems
- Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates
- Algorithms and complexity for a class of combinatorial optimization problems with labelling
- The maximum labeled path problem
- A mixed integer linear formulation for the minimum label spanning tree problem
- Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
- Minimum label \(s\)-\(t\) cut has large integrality gaps
This page was built for publication: On the minimum label spanning tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1567494)
