  This technical report is about grouping vehicles in public transport into
routes so that two vehicles of a route do not overtake each other. We say that
such a set of routes satisfies the FIFO property. A natural question is: Given
a set of trips, find a minimal FIFO grouping into routes. This question is
especially interesting for route planning algorithms since a better route
grouping leads to a better runtime.
