15 citations · 20 across the 7 of their papers we have counts for
Showing 2020 · cs.DSShow all
2 papers · 2 filters
cs.DS2020
Restless reachability problems in temporal graphs
Suhas Thejaswi, Juho Lauri, Aristides Gionis
We study a family of reachability problems under waiting-time restrictions in temporal and vertex-colored temporal graphs. Given a temporal graph and a set of source vertices, we f…
cs.DS2020★ 4 cited
Learning fine-grained search space pruning and heuristics for combinatorial optimization
Juho Lauri, Sourav Dutta, Marco Grassia +1
Combinatorial optimization problems arise in a wide range of applications from diverse domains. Many of these problems are NP-hard and designing efficient heuristics for them requi…