Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
Disjoint Tours and the Price of Diversity
Mark de Berg, Andrés López MartÃnez, Frits Spieksma
We study a variant of the Traveling Salesman Problem, where instead of finding a single tour, we want to find a pair of two edge-disjoint tours whose longer tour is as short as pos…
cs.DS2024
Finding Diverse Minimum s-t Cuts
Mark de Berg, Andrés López MartÃnez, Frits Spieksma
Recently, many studies have been devoted to finding diverse solutions in classical combinatorial problems, such as Vertex Cover (Baste et al., IJCAI'20), Matching (Fomin et al., IS…