Complexity of edge coloring with minimum reload/changeover costs

DOI10.1002/net.21867zbMath1418.90070arXiv1607.06751OpenAlexW2904499178WikidataQ128764058 ScholiaQ128764058MaRDI QIDQ5226172

Mordechai Shalom, Didem Gözüpek

Publication date: 30 July 2019

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.06751

zbMATH Keywords

edge coloringnetwork designapproximation algorithmsnetwork optimizationchangeover costreload cost

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Parameterized complexity of finding a spanning tree with minimum reload cost diameter ⋮ Minimum reload cost graph factors ⋮ Unnamed Item

This page was built for publication: Complexity of edge coloring with minimum reload/changeover costs