TY - GEN A1 - Liebchen, Christian A1 - Wünsch, Gregor A1 - Köhler, Ekkehard A1 - Reiche, Alexander A1 - Rizzi, Romeo T1 - Benchmarks for Strictly Fundamental Cycle Bases N2 - In the Minimum Strictly Fundamental Cycle Basis (MSFCB) problem one is looking for a spanning tree such that the sum of the lengths of its induced fundamental circuits is minimum. We identify square planar grid graphs as being very challenging testbeds for the MSFCB. The best lower and upper bounds for this problem are due to Alon, Karp, Peleg, and West (1995) and to Amaldi et~al. (2004). We improve significantly their bounds, both empirically and asymptotically. Ideally, these new benchmarks will serve as a reference for the performance of any new heuristic for the MSFCB problem which will be designed only in the future. Y1 - 2008 UR - https://opus4.kobv.de/opus4-matheon/frontdoor/index/index/docId/406 UR - https://nbn-resolving.org/urn:nbn:de:0296-matheon-4065 ER -