1 citations · 1 across the 4 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.DM2025
Why Districting Becomes NP-hard
Niklas Jost, Adolfo Escobedo, Alice Kirchheim
This paper investigates why and when the edge-based districting problem becomes computationally intractable. The overall problem is represented as an exact mathematical programming…
cs.DM2025
Approximation guarantees for Hub Covering Problems
Niklas Jost, Florian Jaehn
Hub Covering Problems are a subclass of Hub Location Problems. The objective is to select a set of hubs that enable paths between given origin-destination delivery tasks, while min…