Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs
From MaRDI portal
Publication:2032145
DOI10.1016/j.ipl.2021.106107MaRDI QIDQ2032145
Fabio Rossi, Francesco Santini, Stefano Bistarelli
Publication date: 16 June 2021
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2021.106107
68Qxx: Theory of computing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Residuation for bipolar preferences in soft constraints
- A preference-based approach to spanning trees and shortest paths problems
- Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
- A GRASP algorithm for the multi-criteria minimum spanning tree problem
- On the complexity of finding multi-constrained spanning trees
- Combining linear and nonlinear objectives in spanning tree problems
- Genetic algorithm approach on multi-criteria minimum spanning tree problem
- Solving combinatorial problems with combined min-max-min-sum objective and applications
- A new proof of Cayley's formula for counting labeled trees
- On some multicriteria arborescence problems: Complexity and algorithms
- The multi-criteria minimum spanning tree problem based genetic algorithm
- A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
- Unicast and multicast QoS routing with soft-constraint logic programming
- C-semiring Frameworks for Minimum Spanning Tree Problems
- A Survey on Multiple Objective Minimum Spanning Tree Problems
- Semiring-based constraint satisfaction and optimization
