Scheduling two irregular polygons (Q1104847)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1104847 |
scientific article; zbMATH DE number 4057266
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling two irregular polygons |
scientific article; zbMATH DE number 4057266 |
Statements
Scheduling two irregular polygons (English)
0 references
1988
0 references
The paper deals with the problem of scheduling two irregularly occuring events in such a way that the maximum (minimum) distance between two different events is minimized (maximized). Such a problem is important in constructing schedules for cyclic arrivals of trains, buses etc. It can be modelled by constructing two irregular polygons on some line and moving them in order to minimize (maximize) a distance between adjacent vertices. In the paper, two O(m\(\cdot n\cdot \log m)\) algorithms for the two above variants, are given (m, n being numbers of vertices of the two polygons).
0 references
minimizing maximum distance
0 references
scheduling two irregularly occuring events
0 references
cyclic arrivals of trains
0 references
0.8198513984680176
0 references
0.8140520453453064
0 references
0.8104812502861023
0 references
0.7750323414802551
0 references
