3D geo-graphs: efficient flip verification for the spherical zoning problem

DOI10.1016/j.dam.2023.07.004zbMath1519.05206OpenAlexW4385207885MaRDI QIDQ6110624

Ian G. Ludden, Jacobson, Sheldon H., Douglas M. King

Publication date: 2 August 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.07.004

zbMATH Keywords

combinatorial optimizationgraph partitioningcombinatorial topology3D clusteringlocal search optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra
• Approximating the Maximally Balanced Connected Partition Problem in graphs
• The geo-graph in practice: creating United States congressional districts from census blocks
• Graphs of polyhedra; polyhedra as graphs
• On the complexity of partitioning graphs into connected subgraphs
• Dynamically switching vertices in planar graphs
• Local search algorithms for political districting
• Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
• A Polylogarithmic Approximation of the Minimum Bisection
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• A homology theory for spanning tress of a graph
• A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem
• Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning
• Combinatorial cell complexes and Poincaré duality

This page was built for publication: 3D geo-graphs: efficient flip verification for the spherical zoning problem