Search Results for author:
Found 8 papers, 5 papers with code
More Recent Advances in (Hyper)Graph Partitioning
In recent years, significant advances have been made in the design and evaluation of balanced (hyper)graph partitioning algorithms.
Advanced Flow-Based Multilevel Hypergraph Partitioning
We present an improvement to the flow-based refinement framework of KaHyPar-MF, the current state-of-the-art multilevel $k$-way hypergraph partitioning algorithm for high-quality solutions.
Data Structures and Algorithms
Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
The solution quality is only marginally worse than that of the best-performing hypergraph partitioners KaHyPar and hMETIS, while being one order of magnitude faster.
Data Structures and Algorithms
Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies
Graph partitioning has many applications.
Data Structures and Algorithms
UnLimited TRAnsfers for Multi-Modal Route Planning: An Efficient Solution
We study a multimodal journey planning scenario consisting of a public transit network and a transfer graph which represents a secondary transportation mode (e. g., walking, cycling, e-scooter).
Data Structures and Algorithms
Connection Scan Algorithm
The output consist is a sequence of vehicles such as trains or buses that a traveler should take to get from the source to the target.
Data Structures and Algorithms
Route Planning in Transportation Networks
We survey recent advances in algorithms for route planning in transportation networks.
Data Structures and Algorithms G.2.1; G.2.2; G.2.3; H.2.8; H.3.5; H.4.2
Customizable Contraction Hierarchies
We consider the problem of quickly computing shortest paths in weighted graphs given auxiliary data derived in an expensive preprocessing phase.
