{"id":"https://openalex.org/W1581228220","doi":"https://doi.org/10.1007/978-3-642-00202-1_3","title":"Approximating Shortest Paths in Graphs","display_name":"Approximating Shortest Paths in Graphs","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1581228220","doi":"https://doi.org/10.1007/978-3-642-00202-1_3","mag":"1581228220"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-00202-1_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-00202-1_3","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5110042808","display_name":"Sandeep Sen","orcid":"https://orcid.org/0009-0004-1562-8746"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Sandeep Sen","raw_affiliation_strings":["Department of Comp. Sc. & Engg., Indian Institute of Technology Delhi, New Delhi, India","Department of Comp. Sc. & Engg., Indian Institute of Technology Delhi, New Delhi, India 110016"],"affiliations":[{"raw_affiliation_string":"Department of Comp. Sc. & Engg., Indian Institute of Technology Delhi, New Delhi, India","institution_ids":["https://openalex.org/I68891433"]},{"raw_affiliation_string":"Department of Comp. Sc. & Engg., Indian Institute of Technology Delhi, New Delhi, India 110016","institution_ids":["https://openalex.org/I68891433"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5110042808"],"corresponding_institution_ids":["https://openalex.org/I68891433"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.6291,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.84220297,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"32","last_page":"43"},"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.9998000264167786,"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.9998000264167786,"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.9994999766349792,"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.9944999814033508,"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/computer-science","display_name":"Computer science","score":0.7439038157463074},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5800087451934814},{"id":"https://openalex.org/keywords/contrast","display_name":"Contrast (vision)","score":0.4741846024990082},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.4577227532863617},{"id":"https://openalex.org/keywords/status-quo","display_name":"Status quo","score":0.44836941361427307},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4236431419849396},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4227869212627411},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4175785481929779},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40310120582580566},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.3570634126663208},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18219205737113953}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7439038157463074},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5800087451934814},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.4741846024990082},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.4577227532863617},{"id":"https://openalex.org/C2776748549","wikidata":"https://www.wikidata.org/wiki/Q201610","display_name":"Status quo","level":2,"score":0.44836941361427307},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4236431419849396},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4227869212627411},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4175785481929779},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40310120582580566},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.3570634126663208},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18219205737113953},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-00202-1_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-00202-1_3","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1562956125","https://openalex.org/W1564010364","https://openalex.org/W1574233320","https://openalex.org/W1582742149","https://openalex.org/W1589421353","https://openalex.org/W1822163711","https://openalex.org/W1823654214","https://openalex.org/W1969080501","https://openalex.org/W1969573308","https://openalex.org/W1971052845","https://openalex.org/W1979740015","https://openalex.org/W1987669032","https://openalex.org/W1988067232","https://openalex.org/W2001609476","https://openalex.org/W2002041206","https://openalex.org/W2028293948","https://openalex.org/W2033698604","https://openalex.org/W2034680223","https://openalex.org/W2042333226","https://openalex.org/W2045446569","https://openalex.org/W2049500052","https://openalex.org/W2057994027","https://openalex.org/W2083534148","https://openalex.org/W2092534058","https://openalex.org/W2097747425","https://openalex.org/W2114519394","https://openalex.org/W2130725973","https://openalex.org/W2151021662","https://openalex.org/W2152290683","https://openalex.org/W2156047991","https://openalex.org/W2157760787","https://openalex.org/W2165621523","https://openalex.org/W2502223741","https://openalex.org/W2752885492","https://openalex.org/W4231761369","https://openalex.org/W4239180782","https://openalex.org/W4245082111"],"related_works":["https://openalex.org/W2354846196","https://openalex.org/W2391130892","https://openalex.org/W4293054712","https://openalex.org/W2360981904","https://openalex.org/W2348761196","https://openalex.org/W2347245430","https://openalex.org/W1617152041","https://openalex.org/W2392078542","https://openalex.org/W1519427079","https://openalex.org/W2597144308"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}