Lower Bounds for Strictly Fundamental Cycle Bases in Grid Graphs
Consider the following problem: compute a spanning tree such that the sum of the lengths of its induced fundamental circuits is as small as possible. We motivate why planar square grid graphs are very relevant instances for this problem. In particular, other contributions already showed that the Identification of strong lower bounds is highly challenging. Asymptotically, for a graph on n vertices, Alon et al. [SIAM J Comput 24(1995), 78-100] obtained a lower bound of Omega (n log W. We raise the n log n coefficient by a factor of 325. Concerning optimality proofs, the largest grid for which provably optimum solutions were known is 6 x 6, and It was obtained by massive MIP computing power. Here, we present a combinatorial optimality proof even for the 8 x 8 grid. These two results are complemented by new combinatorial lower bounds for the dimensions in which earlier empirical computations were performed, i.e., for up to 10,000 vertices. (C) 2009 Wiley Periodicals, Inc. NETWORKS, Vol. 53(2), 191-205 2009
spanning tree combinatorial optimization minimum cycle basis planar dual asymptotic analysis