Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Faster and simpler traversal of 0/1-polytopes
Jiří Fink, Petr Hladík, Arturo Merino +2
Recently, Merino and Mütze (FOCS'23+SICOMP'24) presented an algorithm for computing a Hamilton path on the skeleton of any 0/1-polytope , where …
cs.DS2020
Arc-routing for winter road maintenance
Jiří Fink, Martin Loebl
The arc-routing problems are known to be notoriously hard. We study here a natural arc-routing problem on trees and more generally on bounded tree-width graphs and surprisingly sho…