{"id":"https://openalex.org/W1976157781","doi":"https://doi.org/10.1007/bf02523689","title":"On approximating the longest path in a graph","display_name":"On approximating the longest path in a graph","publication_year":1997,"publication_date":"1997-05-01","ids":{"openalex":"https://openalex.org/W1976157781","doi":"https://doi.org/10.1007/bf02523689","mag":"1976157781"},"language":"en","primary_location":{"id":"doi:10.1007/bf02523689","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02523689","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028448267","display_name":"David R. Karger","orcid":"https://orcid.org/0000-0002-0024-5847"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"D. Karger","raw_affiliation_strings":["Department of Computer Science, Stanford University, 94305, Stanford, CA, USA","Department of Computer Science, Stanford University, Stanford, USA 94305"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stanford University, 94305, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Department of Computer Science, Stanford University, Stanford, USA 94305","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112923360","display_name":"R. Motwani","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Motwani","raw_affiliation_strings":["Department of Computer Science, Stanford University, 94305, Stanford, CA, USA","Department of Computer Science, Stanford University, Stanford, USA 94305"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stanford University, 94305, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Department of Computer Science, Stanford University, Stanford, USA 94305","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103495727","display_name":"G. D. S. Ramkumar","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"G. D. S. Ramkumar","raw_affiliation_strings":["Department of Computer Science, Stanford University, 94305, Stanford, CA, USA","Department of Computer Science, Stanford University, Stanford, USA 94305"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stanford University, 94305, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Department of Computer Science, Stanford University, Stanford, USA 94305","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5028448267"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":6.7093,"has_fulltext":false,"cited_by_count":256,"citation_normalized_percentile":{"value":0.97052689,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"18","issue":"1","first_page":"82","last_page":"98"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7445148229598999},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.675979733467102},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.6715155839920044},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.6488258242607117},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6123053431510925},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5296746492385864},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5212600827217102},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5187185406684875},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5104357600212097},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5001142024993896},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4310716688632965},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.32742947340011597},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.294716477394104},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17390096187591553}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7445148229598999},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.675979733467102},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.6715155839920044},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6488258242607117},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6123053431510925},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5296746492385864},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5212600827217102},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5187185406684875},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5104357600212097},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5001142024993896},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4310716688632965},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32742947340011597},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.294716477394104},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17390096187591553},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf02523689","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02523689","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1510805679","https://openalex.org/W1586904125","https://openalex.org/W1894405232","https://openalex.org/W1975099798","https://openalex.org/W2011039300","https://openalex.org/W2040579873","https://openalex.org/W2053651631","https://openalex.org/W2072789827","https://openalex.org/W2074417667","https://openalex.org/W2079473728","https://openalex.org/W2122753831","https://openalex.org/W2123068254","https://openalex.org/W2132605415","https://openalex.org/W2141003493","https://openalex.org/W2141355868","https://openalex.org/W2141815340","https://openalex.org/W2143391442","https://openalex.org/W2145028977","https://openalex.org/W2148043549","https://openalex.org/W2162018802","https://openalex.org/W2572756133","https://openalex.org/W2905110430","https://openalex.org/W3127113455","https://openalex.org/W3152126650","https://openalex.org/W4248492530","https://openalex.org/W4255529553","https://openalex.org/W4256581173","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1618127724","https://openalex.org/W2036803675","https://openalex.org/W2032550399","https://openalex.org/W2057791178","https://openalex.org/W2768859505","https://openalex.org/W2256329187","https://openalex.org/W4387272283","https://openalex.org/W2127206007","https://openalex.org/W2962917430","https://openalex.org/W3207048296"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":16}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}