4 citations · 10 across the 7 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DM2017★ 3 cited
Minimum Reload Cost Cycle Cover in Complete Graphs
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan
The reload cost refers to the cost that occurs along a path on an edge-colored graph when it traverses an internal vertex between two edges of different colors. Galbiati et al.[1]…
cs.DS2017
Parameterized complexity of finding a spanning tree with minimum reload cost diameter
Julien Baste, Didem Gözüpek, Christophe Paul +3
We study the minimum diameter spanning tree problem under the reload cost model (DIAMETER-TREE for short) introduced by Wirth and Steffan (2001). In this problem, given an undirect…