On approximating the longest path in a graph

@article{Karger1997OnAT,
  title={On approximating the longest path in a graph},
  author={David R. Karger and Rajeev Motwani and G. D. S. Ramkumar},
  journal={Algorithmica},
  year={1997},
  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… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 157 CITATIONS, ESTIMATED 95% COVERAGE

The Maximum Binary Tree Problem

VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Lossy Kernelization

VIEW 13 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Floating band D2D: Exploring and exploiting the potentials of adaptive D2D-enabled networks

  • 2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)
  • 2015
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

On the approximability of some degree-constrained subgraph problems

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Circumference of Graphs with Bounded Degree

  • SIAM J. Comput.
  • 2004
VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Finding paths and cycles of superpolylogarithmic length

VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1992
2019

CITATION STATISTICS

  • 15 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-10 OF 20 REFERENCES

Proof verification and hardness of approximation problems

  • Proceedings., 33rd Annual Symposium on Foundations of Computer Science
  • 1992
VIEW 4 EXCERPTS

Finding Hidden Hamiltonian Cycles

  • Random Struct. Algorithms
  • 1994
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Interactive Proofs and Approximation, IBM Research Report RC 17969

M. Bellare
  • 1992
VIEW 1 EXCERPT

The Tale of the Second Prover, The NP-Completeness Col- umn: An Ongoing Guide

David S. Johnson
  • Journal of Algorithms,
  • 1992

Approximating clique is almost NP-complete

  • [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
  • 1991
VIEW 1 EXCERPT