Bitte melden Sie sich an um selbst Rezensionen oder Kommentare zu erstellen.
Zitieren Sie diese Publikation
Mehr Zitationsstile
- bitte auswählen -
%0 Conference Paper
%1 conf/wads/KargerMR93
%A Karger, David R.
%A Motwani, Rajeev
%A Ramkumar, G. D. S.
%B WADS
%D 1993
%E Dehne, Frank K. H. A.
%E Sack, Jörg-Rüdiger
%E Santoro, Nicola
%E Whitesides, Sue
%I Springer
%K dblp
%P 421-432
%T On Approximating the Longest Path in a Graph (Preliminary Version).
%U http://dblp.uni-trier.de/db/conf/wads/wads93.html#KargerMR93
%V 709
%@ 3-540-57155-8
@inproceedings{conf/wads/KargerMR93,
added-at = {2022-10-02T00:00:00.000+0200},
author = {Karger, David R. and Motwani, Rajeev and Ramkumar, G. D. S.},
biburl = {https://www.bibsonomy.org/bibtex/2f11e3e0a640923fba4195c228acaddb1/dblp},
booktitle = {WADS},
crossref = {conf/wads/1993},
editor = {Dehne, Frank K. H. A. and Sack, Jörg-Rüdiger and Santoro, Nicola and Whitesides, Sue},
ee = {https://doi.org/10.1007/3-540-57155-8_267},
interhash = {572e9b65bd96057ac26be04aa175a739},
intrahash = {f11e3e0a640923fba4195c228acaddb1},
isbn = {3-540-57155-8},
keywords = {dblp},
pages = {421-432},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2024-04-10T09:40:07.000+0200},
title = {On Approximating the Longest Path in a Graph (Preliminary Version).},
url = {http://dblp.uni-trier.de/db/conf/wads/wads93.html#KargerMR93},
volume = 709,
year = 1993
}