On approximating the longest path in a graph

@article{Karger2006OnAT,
  title={On approximating the longest path in a graph},
  author={D. Karger and R. Motwani and G. Ramkumar},
  journal={Algorithmica},
  year={2006},
  volume={18},
  pages={82-98}
}
AbstractWe consider the problem of approximating the longest path in undirected graphs. In an attempt to pin down the best achievable performance ratio of an approximation algorithm for this problem, we present both positive and negative results. First, a simple greedy algorithm is shown to find long paths in dense graphs. We then consider the problem of finding paths in graphs that are guaranteed to have extremely long paths. We devise an algorithm that finds paths of a logarithmic length in… Expand
194 Citations
A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs
  • 43
  • PDF
Computing and counting longest paths on circular-arc graphs in polynomial time
  • 1
The Longest Path Problem Is Polynomial on Interval Graphs
  • 42
  • PDF
The Maximum Binary Tree Problem
  • 2
  • Highly Influenced
  • PDF
On a simple randomized algorithm for finding a 2-factor in sparse graphs
  • 7
The Longest Path Problem Is Polynomial on Cocomparability Graphs
  • 14
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 37 REFERENCES
How to Find Long Paths Efficiently
  • 157
Approximating the minimum degree spanning tree to within one from the optimal degree
  • 134
  • PDF
Edmonds polytopes and weakly hamiltonian graphs
  • V. Chvátal
  • Mathematics, Computer Science
  • Math. Program.
  • 1973
  • 159
On the hardness of approximating minimization problems
  • 662
  • PDF
Finding hidden Hamiltonian cycles
  • 27
  • PDF
Tough graphs and hamiltonian circuits
  • V. Chvátal
  • Computer Science, Mathematics
  • Discret. Math.
  • 1973
  • 374
  • PDF
An efficient approximation scheme for the one-dimensional bin-packing problem
  • N. Karmarkar, R. Karp
  • Mathematics, Computer Science
  • 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)
  • 1982
  • 482
Approximate graph coloring by semidefinite programming
  • 70
Approximating Maximum Independent Sets by Excluding Subgraphs
  • 246
Some tools for approximate 3-coloring
  • A. Blum
  • Mathematics, Computer Science
  • Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
  • 1990
  • 45
  • PDF
...
1
2
3
4
...