Zobrazeno 1 - 10
of 53
pro vyhledávání: '"Strasser, Ben A."'
Autor:
Gottesbüren, Lars, Hamann, Michael, Schoch, Philipp, Strasser, Ben, Wagner, Dorothea, Zühlsdorf, Sven
Quasi-threshold graphs are $\{C_4, P_4\}$-free graphs, i.e., they do not contain any cycle or path of four nodes as an induced subgraph. We study the $\{C_4, P_4\}$-free editing problem, which is the problem of finding a minimum number of edge insert
Externí odkaz:
http://arxiv.org/abs/2003.14317
Autor:
Strasser, Ben, Zeitz, Tim
We study exact, efficient and practical algorithms for route planning in large road networks. Routing applications often require integrating the current traffic situation, planning ahead with traffic predictions for the future, respecting forbidden t
Externí odkaz:
http://arxiv.org/abs/1910.12526
We study the problem of quickly computing point-to-point shortest paths in massive road networks with traffic predictions. Incorporating traffic predictions into routing allows, for example, to avoid commuter traffic congestions. Existing techniques
Externí odkaz:
http://arxiv.org/abs/1910.12726
We study large-scale, distributed graph clustering. Given an undirected graph, our objective is to partition the nodes into disjoint sets called clusters. A cluster should contain many internal edges while being sparsely connected to other clusters.
Externí odkaz:
http://arxiv.org/abs/1710.09605
Autor:
Strasser, Ben
We describe the algorithm behind our PACE 2017 submission to the heuristic tree decomposition computation track. It was the only competitor to solve all instances and won a tight second place. The algorithm was originally developed in the context of
Externí odkaz:
http://arxiv.org/abs/1709.08949
We introduce the Connection Scan Algorithm (CSA) to efficiently answer queries to timetable information systems. The input consists, in the simplest setting, of a source position and a desired target position. The output consist is a sequence of vehi
Externí odkaz:
http://arxiv.org/abs/1703.05997
Autor:
Strasser, Ben
We study the earliest arrival problem in road networks with static time-dependent functions as arc weights. We propose and evaluate the following simple algorithm: (1) average the travel time in k time windows, (2) compute a shortest time-independent
Externí odkaz:
http://arxiv.org/abs/1606.06636
We study a scenario for route planning in road networks, where the objective to be optimized may change between every shortest path query. Since this invalidates many of the known speedup techniques for road networks that are based on preprocessing o
Externí odkaz:
http://arxiv.org/abs/1509.03165
We introduce Quasi-Threshold Mover (QTM), an algorithm to solve the quasi-threshold (also called trivially perfect) graph editing problem with edge insertion and deletion. Given a graph it computes a quasi-threshold graph which is close in terms of e
Externí odkaz:
http://arxiv.org/abs/1504.07379
Autor:
Hamann, Michael, Strasser, Ben
We introduce FlowCutter, a novel algorithm to compute a set of edge cuts or node separators that optimize cut size and balance in the Pareto-sense. Our core algorithm solves the balanced connected st-edge-cut problem, where two given nodes s and t mu
Externí odkaz:
http://arxiv.org/abs/1504.03812