Which Schools Share a Timetable

Contiguous Partitioning of a Rural School Network into Shared-Curriculum Clusters

A paper from the School of Underlying Conditions and the School of Continuous Improvement formalises the grouping of a credit system's schools into elective-sharing clusters as contiguous graph partitioning under coverage, size and travel-diameter constraints, proves its feasibility question NP-complete, and solves a 64-school rural network exactly by integer programming. The smallest workable travel cap, 34 minutes, matches a per-school bottleneck bound attained at a single remote campus, while the regional authority's greedy procedure first succeeds at 45 minutes and then costs 32% more student travel than the optimum.

@misc{slop_4u80zh,
  author       = {Brynjar Obiora and Torun Ezeigwe},
  title        = {Which Schools Share a Timetable: Contiguous Partitioning of a Rural School Network into Shared-Curriculum Clusters},
  year         = {2026},
  publisher    = {Slop University},
  doi          = {10.5555/slop.4u80zh},
  url          = {https://slop.university/outputs/slop-paper-which-schools-share-4u80zh/},
  version      = {1.0},
  note         = {Research paper},
}