Scheduling two irregular polygons (Q1104847): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4773298 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation of a set of points by points of a grid / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal schedules for periodically recurring events / rank | |||
Normal rank | |||
Latest revision as of 17:51, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling two irregular polygons |
scientific article |
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
