Advertisement

Approximating Longest Directed Paths and Cycles

  • Andreas Björklund
  • Thore Husfeldt
  • Sanjeev Khanna
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3142)

Abstract

We investigate the hardness of approximating the longest path and the longest cycle in directed graphs on n vertices. We show that neither of these two problems can be polynomial time approximated within n 1 − − ε for any ε> 0 unless P=NP. In particular, the result holds for digraphs of constant bounded outdegree that contain a Hamiltonian cycle.

Assuming the stronger complexity conjecture that Satisfiability cannot be solved in subexponential time, we show that there is no polynomial time algorithm that finds a directed path of length Ω(f(n)log2 n), or a directed cycle of length Ω(f(n)log n), for any nondecreasing, polynomial time computable function f in ω(1). With a recent algorithm for undirected graphs by Gabow, this shows that long paths and cycles are harder to find in directed graphs than in undirected graphs.

We also find a directed path of length Ω(log2 n/loglog n) in Hamiltonian digraphs with bounded outdegree. With our hardness results, this shows that long directed cycles are harder to find than a long directed paths. Furthermore, we present a simple polynomial time algorithm that finds paths of length Ω(n) in directed expanders of constant bounded outdegree.

Keywords

Polynomial Time Undirected Graph Polynomial Time Algorithm Hamiltonian Cycle Longe Path 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alon, N., Yuster, R., Zwick, U.: Color-coding. Journal of the ACM 42(4), 844–856 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Björklund, A., Husfeldt, T.: Finding a path of superlogarithmic length. SIAM Journal on Computing 32(6), 1395–1402 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Bollobás, B.: Random graphs, 2nd edn. Cambridge University Press, Cambridge (2001)zbMATHGoogle Scholar
  4. 4.
    Feder, T., Motwani, R., Subi, C.: Approximating the longest cycle problem in sparse graphs. SIAM Journal on Computing 31(5), 1596–1607 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theoretical Computer Science 10, 111–121 (1980)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Gabow, H.N.: Finding paths and cycles of superlogarithmic length. In: Proc. 36th STOC (2004)Google Scholar
  7. 7.
    Gabow, H.N., Nie, S.: Finding a long directed cycle. In: Proc. 15th SODA (2004)Google Scholar
  8. 8.
    Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. Journal of Computer and Systems Sciences 62(2), 367–375 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? In: Proc. 39th FOCS, pp. 653–663 (1998)Google Scholar
  10. 10.
    Karger, D., Motwani, R., Ramkumar, G.D.S.: On approximating the longest path in a graph. Algorithmica 18(1), 82–98 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)zbMATHGoogle Scholar
  12. 12.
    Robertson, N., Seymour, P.D.: Graph minors XIII: The disjoints paths problem. J. Combinatorial Theory Ser. B 35 (1983)Google Scholar
  13. 13.
    Schaefer, T.J.: The complexity of satisfiability problems. In: Proc. 10th STOC, pp. 216–226 (1978)Google Scholar
  14. 14.
    Vishwanathan, S.: An approximation algorithm for finding a long path in Hamiltonian graphs. In: Proc. 11th SODA, pp. 680–685 (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Andreas Björklund
    • 1
  • Thore Husfeldt
    • 1
  • Sanjeev Khanna
    • 2
  1. 1.Department of Computer ScienceLund UniversityLundSweden
  2. 2.Dept. of CISUniversity of PennsylvaniaPhiladelphiaUSA

Personalised recommendations