{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:56:50Z","timestamp":1725562610050},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220671"},{"type":"electronic","value":"9783540248385"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24838-5_2","type":"book-chapter","created":{"date-parts":[[2010,8,8]],"date-time":"2010-08-08T17:34:14Z","timestamp":1281288854000},"page":"14-29","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases"],"prefix":"10.1007","author":[{"given":"Edoardo","family":"Amaldi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leo","family":"Liberti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nelson","family":"Maculan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Maffioli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","first-page":"577","volume-title":"Theory of Applications of Graphs","author":"M. Sys\u0142o","year":"1981","unstructured":"Sys\u0142o, M.: On some problems related to fundamental cycle sets of a graph. In: Chartrand, R. (ed.) Theory of Applications of Graphs, pp. 577\u2013588. Wiley, Chichester (1981)"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1002\/andp.18471481202","volume":"72","author":"G. Kirchhoff","year":"1847","unstructured":"Kirchhoff, G.: \u00dcber die aufl\u00f6sung der gleichungen, auf welche man bei der untersuchungen der linearen verteilung galvanisher str\u00f6me gef\u00fchrt wird. Poggendorf Annalen Physik\u00a072, 497\u2013508 (1847)","journal-title":"Poggendorf Annalen Physik"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1002\/net.3230090203","volume":"9","author":"M. Sys\u0142o","year":"1979","unstructured":"Sys\u0142o, M.: On cycle bases of a graph. Networks\u00a09, 123\u2013132 (1979)","journal-title":"Networks"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1109\/TCS.1982.1085125","volume":"29","author":"M. Sys\u0142o","year":"1982","unstructured":"Sys\u0142o, M.: On the fundamental cycle set graph. IEEE Transactions on Circuits and Systems\u00a029, 136\u2013138 (1982)","journal-title":"IEEE Transactions on Circuits and Systems"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1137\/0216026","volume":"16","author":"J. Horton","year":"1987","unstructured":"Horton, J.: A polynomial-time algorithm to find the shortest cycle basis of a graph. SIAM Journal of Computing\u00a016, 358\u2013366 (1987)","journal-title":"SIAM Journal of Computing"},{"key":"2_CR6","unstructured":"Amaldi, E., Rizzi, R.: Personal communication (2003)"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/355984.355988","volume":"8","author":"N. Deo","year":"1982","unstructured":"Deo, N., Prabhu, G., Krishnamoorthy, M.: Algorithms for generating fundamental cycles in a graph. ACM Transactions on Mathematical Software\u00a08, 26\u201342 (1982)","journal-title":"ACM Transactions on Mathematical Software"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-540-24592-6_12","volume-title":"Approximation and Online Algorithms","author":"G. Galbiati","year":"2004","unstructured":"Galbiati, G., Amaldi, E.: On the approximability of the minimum fundamental cycle basis problem. In: Solis-Oba, R., Jansen, K. (eds.) WAOA 2003. LNCS, vol.\u00a02909, pp. 151\u2013164. Springer, Heidelberg (2004)"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"938","DOI":"10.1109\/81.940184","volume":"48","author":"A. Brambilla","year":"2001","unstructured":"Brambilla, A., Premoli, A.: Rigorous event-driven (RED) analysis of large-scale nonlinear RC circuits. IEEE Transactions on Circuits and Systems\u2013I: Fundamental Theory and Applications\u00a048, 938\u2013946 (2001)","journal-title":"IEEE Transactions on Circuits and Systems\u2013I: Fundamental Theory and Applications"},{"key":"2_CR10","volume-title":"Electronic Notes in Theoretical Computer Science","author":"C. Liebchen","year":"2002","unstructured":"Liebchen, C., M\u00f6hring, R.H.: A case study in periodic timetabling. In: Wagner, D. (ed.) Electronic Notes in Theoretical Computer Science, vol.\u00a066, Elsevier, Amsterdam (2002)"},{"key":"2_CR11","first-page":"141","volume":"107","author":"N. Deo","year":"1995","unstructured":"Deo, N., Kumar, N., Parsons, J.: Minimum-length fundamental-cycle set problem: New heuristics and an empirical investigation. Congressus Numerantium\u00a0107, 141\u2013154 (1995)","journal-title":"Congressus Numerantium"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/363219.363232","volume":"12","author":"K. Paton","year":"1969","unstructured":"Paton, K.: An algorithm for finding a fundamental set of cycles of a graph. Communications of the ACM\u00a012, 514\u2013518 (1969)","journal-title":"Communications of the ACM"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1137\/S0097539794270881","volume":"26","author":"A. Shioura","year":"1997","unstructured":"Shioura, A., Tamura, A., Uno, T.: An optimal algorithm for scanning all spanning trees of undirected graphs. SIAM Journal of Computing\u00a026, 678\u2013692 (1997)","journal-title":"SIAM Journal of Computing"},{"key":"2_CR14","volume-title":"Handbook of Metaheuristics","author":"P. Hansen","year":"2003","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighbourhood search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, Kluwer, Dordrecht (2003)"},{"key":"2_CR15","first-page":"121","volume-title":"Local Search in Combinatorial Optimization","author":"A. Hertz","year":"1997","unstructured":"Hertz, A., Taillard, E., de Werra, D.: Tabu search. In: Aarts, E., Lenstra, J. (eds.) Local Search in Combinatorial Optimization, pp. 121\u2013136. Wiley, Chichester (1997)"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Liberti, L., Amaldi, E., Maculan, N., Maffioli, F.: Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases. Submitted to Yugoslav Journal of Operations Research (2003)","DOI":"10.1016\/j.endm.2004.03.009"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1137\/0402049","volume":"2","author":"P. Serafini","year":"1989","unstructured":"Serafini, P., Ukovich, W.: A mathematical model for periodic scheduling problems. SIAM Journal of Discrete Mathematics\u00a02, 550\u2013581 (1989)","journal-title":"SIAM Journal of Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24838-5_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T13:50:48Z","timestamp":1685713848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24838-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220671","9783540248385"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24838-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}