Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning

Graph partitioning is an intractable problem that arises in many practical applications. Heuristics such as local search generate good (though suboptimal) solutions in limited time. Such heuristics must be able to explore the solution space quickly and, when the solution space is constrained, differ...

Ausführliche Beschreibung