Edge-swapping algorithms for the minimum fundamental cycle basis problem

Mathematical Methods of Operations Research

Volumn 69, Issue 2, 2009, Pages 205-233

  Amaldi, Edoardo ^a   Liberti, Leo ^b   Maffioli, Francesco ^a   MacUlan, Nelson ^c  

^a POLITECNICO DI MILANO   (Italy)

^b ÉCOLE POLYTECHNIQUE   (France)

^c FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Cycle basis; Edge swap; Fundamental cut; Fundamental cycle; Heuristic; Metaheuristic

Indexed keywords

HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; TABU SEARCH; TREES (MATHEMATICS);

CYCLE BASIS; EDGE SWAP; FUNDAMENTAL CUT; FUNDAMENTAL CYCLES; HEURISTIC; METAHEURISTIC;

ITERATIVE METHODS;

EID: 63049103955     PISSN: 14322994     EISSN: 14325217     Source Type: Journal    
DOI: 10.1007/s00186-008-0255-4     Document Type: Article

References (37)

1. N Alon R Karp D Peleg D West 1995 A graph-theoretic game and its application to the k-server problem SIAM J Comput 24 78 100
2. Amaldi E, Liberti L, Maculan N, Maffioli F (2004) Efficient edge-swapping heuristics for finding minimum fundamental cycle bases. In: Ribeiro C, Martins S (eds) Experimental and efficient algorithms-WEA2004 proceedings, Lecture Notes in Computer Science, vol 3059. Springer, Heidelberg, pp 15-29
3. A Brambilla A Premoli 2001 Rigorous event-driven (red) analysis of large-scale nonlinear rc circuits IEEE Trans Circuits Syst I Fundam Theory Appl 48 8 938 946
4. N Deo G Prabhu M Krishnamoorthy 1982 Algorithms for generating fundamental cycles in a graph ACM Trans Math Softw 8 1 26 42
5. N Deo N Kumar J Parsons 1995 Minimum-length fundamental-cycle set problem: new heuristics and an empirical investigation Congressus Numerantium 107 141 154
6. Elkin M, Emek Y, Spielman D, Teng S-H (2005) Lower-stretch spanning trees. In: STOC '05: Proceedings of the 37th annual ACM symposium on theory of computing, ACM, New York, pp 494-503
7. M Elkin C Liebchen R Rizzi 2007 New length bounds for cycle bases Inf Process Lett 104 186 193
8. M Fischetti G Lancia P Serafini 2002 Exact algorithms for minimum routing cost trees Networks 93 3 161 173
9. H Gabow E Myers 1978 Finding all spanning trees of directed and undirected graphs SIAM J Comput 7 3 280 287
10. Galbiati G, Rizzi R, Amaldi E (2007) On the approximability of the minimum strictly fundamental cycle bases problem. Technical Report, DEI, Politecnico di Milano
11. Guta B (2003) Subgradient optimization methods in integer programming, with an application to a radiation therapy problem. PhD thesis, Kaiserslautern University
12. P Hansen N Mladenović 2001 Variable neighbourhood search: principles and applications Eur J Oper Res 130 449 467
13. Hansen P, Mladenović N (2002) Variable neighbourhood search. In: Pardalos P, Resende M (eds) Handbook of applied optimization. Oxford University Press, Oxford
14. D Hartvigsen E Zemel 1989 Is every cycle basis fundamental? J Graph Theory 13 1 117 137
15. Hertz A, Taillard E, de Werra D (1997) Tabu search. In: Aarts E, Lenstra J (eds) Local search in combinatorial optimization. Wiley, Chichester, pp 121-136
16. J Horton 1987 A polynomial-time algorithm to find the shortest cycle basis of a graph SIAM J Comput 16 2 358 366
17. Hubicka E, Sysło M (1975) Minimal bases of cycles of a graph. In: Recent advances in graph theory, second Czech symposium in graph theory. Academia, Prague, pp 283-293
18. ILOG (2002) ILOG CPLEX 8.0 User's Manual, ILOG S.A., Gentilly, France
19. Kavitha T, Mehlhorn K, Michail D, Paluch K (2004) A faster algorithm for minimum cycle bases of graphs. In: Proceedings of ICALP, Lecture Notes in Computer Science, vol 3124. Springer, Heidelberg, pp 846-857
20. G Kirchhoff 1847 Über die auflösung der gleichungen, auf welche man bei der untersuchungen der linearen verteilung galvanischer ströme geführt wird Poggendorf Ann Phys 72 497 508
21. Liebchen C (2003) Finding short integral cycle bases for cyclic timetabling. In: Algorithms-ESA2003 proceedings, Lecture Notes in Computer Science, vol 2832. Springer, Heidelberg, pp 715-726
22. Liebchen C, Möhring R (2002) A case study in periodic timetabling. In: Wagner D (eds) Electronic notes in theoretical computer science, vol 66. Elsevier, Amsterdam
23. 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, New York, pp 365-378
24. L Liberti E Amaldi N Maculan F Maffioli 2005 Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases Yugoslav J Oper Res 15 1 15 24
25. Lissoni L (2003) Implementazione di un algoritmo efficiente per determinare una base di cicli minima di un grafo, tesi di Laurea, DEI, Politecnico di Milano
26. K Mehlhorn S Näher 1995 LEDA: a platform for combinatorial and geometric computing Commun ACM 38 1 96 102
27. K Paton 1969 An algorithm for finding a fundamental set of cycles of a graph Commun ACM 12 9 514 518
28. A Shioura A Tamura T Uno 1997 An optimal algorithm for scanning all spanning trees of undirected graphs SIAM J Comput 26 3 678 692
29. P Serafini W Ukovich 1989 A mathematical model for periodic scheduling problems SIAM J Discrete Math 2 4 550 581
30. EJ Sussenouth 1965 A graph theoretical algorithm for matching chemical structures J Chem Doc 5 36 43
31. Sysło M (1978) An efficient cycle vector space algorithm for listing all cycles of a planar graph, Colloquia Mathematica Societatis János Bolyai, pp 749-762
32. M Sysło 1979 On cycle bases of a graph Networks 9 123 132
33. Sysło M (1981) On some problems related to fundamental cycle sets of a graph. In: Chartrand R (eds) Theory of applications of graphs. Wiley, New York, pp 577-588
34. M Sysło 1982 On some problems related to fundamental cycle sets of a graph: research notes Discrete Math 7 145 157
35. M Sysło 1982 On the fundamental cycle set graph IEEE Trans Circuits Syst 29 3 136 138
36. Vismara P (1995) Reconnaissance et représentation d'éléments structuraux pour la description d'objets complexes. application à l'élaboration de stratégies de synthèse en chimie organique, PhD thesis, Université de Montpellier II, France
37. BY Wu G Lancia VF Bafna R Chao K-M Ravi C Tang 1999 A polynomial-time approximation scheme for minimum routing cost spanning trees SIAM J Comput 29 761 778