David R. Karger, Rajeev Motwani, G. D. S. Ramkumar. On Approximating the Longest Path in a Graph (Preliminary Version). In Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro, Sue Whitesides, editors, Algorithms and Data Structures, Third Workshop, WADS 93, Montréal, Canada, August 11-13, 1993, Proceedings. Volume 709 of Lecture Notes in Computer Science, pages 421-432, Springer, 1993.
@inproceedings{KargerMR93, title = {On Approximating the Longest Path in a Graph (Preliminary Version)}, author = {David R. Karger and Rajeev Motwani and G. D. S. Ramkumar}, year = {1993}, tags = {graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/KargerMR93}, cites = {0}, citedby = {0}, pages = {421-432}, booktitle = {Algorithms and Data Structures, Third Workshop, WADS 93, Montréal, Canada, August 11-13, 1993, Proceedings}, editor = {Frank K. H. A. Dehne and Jörg-Rüdiger Sack and Nicola Santoro and Sue Whitesides}, volume = {709}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-57155-8}, }