On Minimum Changeover Cost Arborescences
From MaRDI portal
Publication:3005849
DOI10.1007/978-3-642-20662-7_10zbMath1360.68478OpenAlexW1520199687MaRDI QIDQ3005849
Giulia Galbiati, Francesco Maffioli, Stefano Gualandi
Publication date: 10 June 2011
Published in: Experimental Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20662-7_10
Programming involving graphs or networks (90C35) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Parameterized complexity of the MinCCA problem on graphs of bounded decomposability, Combinatorial optimization with one quadratic term: spanning trees and forests, Parameterized complexity of finding a spanning tree with minimum reload cost diameter, Precedence-constrained arborescences, On the complexity of constructing minimum changeover cost arborescences, Constructing minimum changeover cost arborescenses in bounded treewidth graphs, Minimum reload cost graph factors, Unnamed Item