kit-algo Goto Github PK

bike-sharing

Journey planning algorithms for multi-modal transportation networks with bike sharing.

catchup

Paper, code, experiments and evaluation for ESA2020 paper "Space-efficient, Fast and Exact Routing in Time-dependent Road Networks"

cchpp

ch_potentials

Source code for the CH-Potentials algorithm implementation and experimental evaluation of the SEA2021 paper "A Fast and Tight Heuristic for A* in Road Networks"

connectionbasedassignment

distributed_clustering_thrill

Distributed Graph Clustering using the experimental Thrill framework

distributed_clustering_thrill_evaluation

Jupyter Notebooks to analyse the results of the experimental evaluation of https://github.com/kit-algo/distributed_clustering_thrill

domjudge

DOMjudge programming contest jury system

flow-cutter

Experimental FlowCutter Code

flow-cutter-pace17

Submission to PACE 17

fpt-editing

Implementation of exact F-free edge editing algorithms

hyperflowcutter

Prototype implementation of the HyperFlowCutter algorithm and its refinement variant for hypergraph bipartitioning, accompanying our publication at ESA19

ilp-abstraction

ILP abstraction layer on top of CPLEX and Gurobi

inertialflowcutter

C++ implementation and evaluation for the InertialFlowCutter algorithm to compute Customizable Contraction Hierarchy orders.

lcd-cliques-experiments

Experimental Evaluation of "Local Community Detection based on Small Cliques"

lcd-cliques-networkit

Fork of NetworKit containing the exact version used for the experiments of the paper "Local Community Detection based on Small Cliques". 2021 branch contains fixes for bugs discovered after the publication.

msppsd

negative-cycle-canceling-windfarms

An implementation of Negative Cycle Canceling for the Windfarm Cabling Problem

rust_road_router

scaling

tcpspsuite

A software suite for optimizing various flavours of the Time Constrained Project Scheduling Problem

tdpot

temporalmaplabeling

The software framework accompanying "Temporal Map Labeling: A New Unified Framework with experiments"

traffic_aware

Fast Computation of Shortest Smooth Paths and Uniformly Bounded Stretch with Lazy RPHAST

ultra

UnLimited TRAnsfers for Multi-Modal Route Planning

ultra-phast

One-to-many variant of ULTRA

ultra-transfer-time

Algorithms for fast multimodal journey planning with three criteria

ultra-trip-based

Integrated variant of the ULTRA and Trip-Based algorithms