14 citations · 42 across the 11 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2017★ 10 cited
Efficient Information Flow Maximization in Probabilistic Graphs
Christian Frey, Andreas Züfle, Tobias Emrich +1
Reliable propagation of information through large networks, e.g., communication networks, social networks or sensor networks is very important in many applications concerning marke…
cs.DS2016★ 3 cited
Scenic Routes Now: Efficiently Solving the Time-Dependent Arc Orienteering Problem
Gregor Jossé, Ying Lu, Tobias Emrich +4
This paper extends the Arc Orienteering Problem (AOP) to large road networks with time-dependent travel times and time-dependent value gain, termed Twofold Time-Dependent AOP or 2T…