Efficient approximation algorithms for shortest cycles in undirected graphs

Information Processing Letters

Volumn 109, Issue 10, 2009, Pages 493-498

  Lingas, Andrzej ^a   Lundell, Eva Marta ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

Approximation algorithm; Graph algorithm; Shortest cycle; Time complexity; Undirected graph

Indexed keywords

COMBINATORIAL MATHEMATICS; GRAPH THEORY;

EDGE WEIGHTS; EFFICIENT APPROXIMATION ALGORITHMS; GRAPH ALGORITHM; HIGH PROBABILITIES; MINIMUM WEIGHTS; SHORTEST CYCLE; TIME COMPLEXITY; UNDIRECTED GRAPH;

APPROXIMATION ALGORITHMS;

EID: 62549109487     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2009.01.008     Document Type: Article

References (27)

1. Aingworth D., Chekuri C., Indyk P., and Motwani R. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM Journal on Computing 28 4 (1999) 1167-1181
2. Alon N., Yuster R., and Zwick U. Color-coding. Journal of the ACM 42 4 (1995) 844-856
3. Alon N., Yuster R., and Zwick U. Finding and counting given length cycles. Algorithmica 17 3 (1997) 209-223
4. 2 polylog n) time. Proc. 22nd Annual Symposium on Theoretical Aspects of Computer Science. LNCS vol. 3404 (2005), Springer-Verlag 666-679
5. S. Baswana, T. Kavitha, Faster algorithms for approximate distance oracles and all-pairs small stretch paths, in: Proc. 47th Annual IEEE Symposium on Foundations of Computer Science, 2006, pp. 591-602
6. Berman P., and Kasiviswanathan S.P. Faster approximation of distances in graphs. Proc. 10th Workshop on Algorithms and Data Structures. LNCS vol. 4619 (2007), Springer-Verlag 541-552
7. Caprara A., Panconesi A., and Rizzi R. Packing cycles in undirected graphs. Journal of Algorithms 48 1 (2003) 239-256
8. T. Chan, More algorithms for all-pairs shortest paths in weighted graphs, in: Proc. 39th Annual ACM Symposium on Theory of Computing, 2007, pp. 590-598
9. Cohen E., and Zwick U. All-pairs small-stretch paths. Journal of Algorithms 38 2 (2001) 335-353
10. Cormen T.H., Leiserson C.E., and Rivest R.L. Introduction to Algorithms (1990), The MIT Press, Cambridge
11. A. Czumaj, A. Lingas, Finding a heaviest triangle is not harder than matrix multiplication, in: Proc. 18th ACM-SIAM Symposium on Discrete Algorithms, 2007, pp. 986-994
12. Diestel R. Graph Theory (2000), Springer-Verlag
13. Djidjev H. Computing the girth of a planar graph. Proc. 27th International Colloquium on Automata, Languages and Programming. LNCS vol. 1853 (2000), Springer-Verlag 821-831
14. Dor D., Halperin S., and Zwick U. All-pairs almost shortest paths. SIAM Journal on Computing 29 5 (2000) 1740-1759
15. Horton J.D. A polynomial-time algorithm to find the shortest cycle basis of a graph. SIAM Journal on Computing 16 2 (1987) 358-366
16. Itai A., and Rodeh M. Finding a minimum circuit in a graph. SIAM Journal on Computing 7 4 (1978) 413-423
17. Kavitha T., Mehlhorn K., Michail D., and Paluch K. A faster algorithm for Minimum Cycle Basis of graphs. Proc. 31st International Colloquium on Automata, Languages and Programming. LNCS vol. 3142 (2004), Springer-Verlag 846-857
18. Kavitha T., Mehlhorn K., and Michail D. New approximation algorithms for Minimum Cycle Bases of graphs. Proc. 24th International Symposium on Theoretical Aspects of Computer Science. LNCS vol. 4393 (2007), Springer-Verlag 512-523
19. M. Krivelevich, Z. Nutov, R. Yuster, Approximation algorithms for Cycle Packing Problems, in: Proc. 16th Annual ACM-SIAM Symposium on Discrete Algorithms, Vancouver, 2005, pp. 556-561
20. Salavatipour M.R., and Verstraete J. Disjoint cycles: Integrality gap, hardness, and approximation. Proc. 11th International IPCO Conference, 2005. LNCS vol. 3509 (2005), Springer-Verlag 51-65
21. Schank T., and Wagner D. Finding, counting and listing all triangles in large graphs, an experimental study. Proc. 4th International Workshop on Experimental and Efficient Algorithms. LNCS vol. 3503 (2005), Springer-Verlag 606-609
22. Takaoka T. A Faster algorithm for the all-pairs shortest path problem and its application. Proc. 10th Annual International Computing and Combinatorics Conference. LNCS vol. 3106 (2004), Springer-Verlag 278-289
23. Vassilevska V., Williams R., and Yuster R. Finding the smallest H-subgraph in real weighted graphs and related problems. Proc. 33rd International Colloquium on Automata, Languages and Programming. LNCS vol. 4051 (2006), Springer-Verlag 262-273
24. 3 - δ time, with applications, in: Proc. 38th ACM Symposium on Theory of Computing, 2006, pp. 225-231
25. Yuster R., and Zwick U. Finding even cycles even faster. Proc. 21st International Colloquium on Automata, Languages and Programming. LNCS vol. 820 (1994), Springer-Verlag 532-543
26. R. Yuster, U. Zwick, Detecting short directed cycles using rectangular matrix multiplication and dynamic programming, in: Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms, 2004, pp. 254-260
27. Zwick U. Exact and approximate distances in graphs - A survey. Proc. 9th Annual European Symposium on Algorithms. LNCS vol. 2161 (2001), Springer-Verlag 33-48