Abstract
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 their bounds significantly, both empirically and asymptotically. Ideally, these new benchmarks will serve as a reference for the performance of any new heuristic for the MSFCB problem.
Supported by the DFG Research Center Matheon in Berlin and by the DFG Research Training Group GK-621 “Stochastic Modelling and Quantitative Analysis of Complex Systems in Engineering” (MAGSI).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Karp, R.M., Peleg, D., West, D.B.: A graph-theoretic game and its application to the k-server problem. SIAM J. Comput. 24(1), 78–100 (1995)
Amaldi, E., Liberti, L., Maculan, N., Maffioli, F.: Efficient edge-swapping heuristics for finding minimum fundamental cycle bases. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol. 3059, pp. 14–29. Springer, Heidelberg (2004)
Bächle, S., Ebert, F.: Graph theoretical algorithms for index reduction in circuit simulation. Preprint 245, DFG Research Center Matheon (2005)
Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybern. 11(1-2), 1–22 (1993)
Boksberger, P.: Minimum stretch spanning trees. Diploma thesis, ETH Zürich (2003)
Bollobás, B.: Modern Graph Theory. In: Hutchison, D., Shepherd, W.D., Mariani, J.A. (eds.) Local Area Networks: An Advanced Course. LNCS, vol. 184, Springer, Heidelberg (2002) (2nd printing)
Deo, N., Krishnomoorthy, M., Prabhu, G.: Algorithms for generating fundamental cycles in a graph. ACM Transactions on Mathematical Software 8(1), 26–42 (1982)
Deo, N., Kumar, N., Parsons, J.: Minimum-length fundamental cycle set: New heuristics and an empirical study. Congressus Numerantium 107, 141–154 (1995)
Elkin, M., Emek, Y., Spielman, D.A., Teng, S.-H.: Lower-stretch spanning trees. In: Gabow, H.N., Fagin, R. (eds.) STOC, pp. 494–503. ACM Press, New York (2005)
Gleiss, P.M.: Short Cycles. Ph.D. thesis, Universität Wien (2001)
Gotlieb, C.C., Corneil, D.G.: Algorithms for finding a fundamental set of cycles for an undirected linear graph. Communications of the ACM 10(12), 780–783 (1967)
Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.E.: A faster algorithm for minimum cycle basis of graphs. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 846–857. Springer, Heidelberg (2004)
Köhler, E., Liebchen, C., Rizzi, R., Wünsch, G.: Reducing the optimality gap of strictly fundamental cycle bases in planar grids. Preprint 007/2006, TU Berlin, Mathematical Institute (2006)
Köhler, E., Möhring, R.H., Wünsch, G.: Minimizing total delay in fixed-time controlled traffic networks. In: Fleuren, H., den Hertog, D., Kort, P. (eds.) Operations Research Proceedings 2004, pp. 192–199. Springer, Heidelberg (2005)
Liberti, L., Amaldi, E., Maculan, F.M.N.: Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases. Yug. J. of Oper. Res. 15(1), 15–24 (2005)
Liebchen, C.: Periodic Timetable Optimization in Public Transport. dissertation.de – Verlag im Internet (2006)
Liebchen, C., Wünsch, G.: The Zoo of tree spanner problems. Technical Report 2006-013, TU Berlin, Mathematical Institute (2006)
Liebchen, C., Wünsch, G.: Manuscript (2007)
Liebchen, C., Wünsch, G., Köhler, E., Reich, A., Rizzi, R.: Benchmarks for strictly fundamental cycle bases. Preprint 003/2007, TU Berlin, Mathematical Institute (2007)
Paton, K.: An algorithm for finding a fundamental set of cycles of a graph. Communications of the ACM 12(9), 514–518 (1969)
Robertson, N., Seymour, P.D.: Graph minors. V. Excluding a planar graph. J. Comb. Theory, Ser. B. 41(1), 92–114 (1986)
Schrijver, A.: Combinatorial Optimization. In: Parallel Processing. LNCS, vol. 24, Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Liebchen, C., Wünsch, G., Köhler, E., Reich, A., Rizzi, R. (2007). Benchmarks for Strictly Fundamental Cycle Bases. In: Demetrescu, C. (eds) Experimental Algorithms. WEA 2007. Lecture Notes in Computer Science, vol 4525. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72845-0_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-72845-0_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72844-3
Online ISBN: 978-3-540-72845-0
eBook Packages: Computer ScienceComputer Science (R0)