2 papers
cs.DS2017
Walking Through Waypoints
Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Stefan Schmid
We initiate the study of a fundamental combinatorial problem: Given a capacitated graph , find a shortest walk ("route") from a source to a destination t…
cs.DC2017
Distributed Domination on Graph Classes of Bounded Expansion
Saeed Akhoondian Amiri, Patrice Ossona de Mendez, Roman Rabinovich +1
We provide a new constant factor approximation algorithm for the (connected) distance- dominating set problem on graph classes of bounded expansion. Classes of bounded expansion…