{"id":"https://openalex.org/W2051814072","doi":"https://doi.org/10.1007/s00453-003-1046-1","title":"New Results on Path Approximation","display_name":"New Results on Path Approximation","publication_year":2003,"publication_date":"2003-10-24","ids":{"openalex":"https://openalex.org/W2051814072","doi":"https://doi.org/10.1007/s00453-003-1046-1","mag":"2051814072"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-003-1046-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-003-1046-1","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/A5078438902","display_name":"Ovidiu Daescu","orcid":"https://orcid.org/0000-0002-0278-4174"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ovidiu Daescu","raw_affiliation_strings":["Department of Computer Science,\n        University of Texas at Dallas,\n        Richardson, TX 75080, USA","Department of Computer Science University of Texas at Dallas Richardson TX 75080 USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science,\n        University of Texas at Dallas,\n        Richardson, TX 75080, USA","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"Department of Computer Science University of Texas at Dallas Richardson TX 75080 USA","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5078438902"],"corresponding_institution_ids":["https://openalex.org/I162577319"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.8885,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.74613121,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"38","issue":"1","first_page":"131","last_page":"143"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9983999729156494,"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"}},{"id":"https://openalex.org/T10757","display_name":"Geographic Information Systems Studies","score":0.991100013256073,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6294670104980469},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6072342395782471},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6061417460441589},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.5654096007347107},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.5190918445587158},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5107917785644531},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.508761465549469},{"id":"https://openalex.org/keywords/approximation-error","display_name":"Approximation error","score":0.4847649931907654},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.437615305185318},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4299173355102539},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41577354073524475},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3911515474319458},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38741394877433777},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3589598536491394},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24227458238601685}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6294670104980469},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6072342395782471},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6061417460441589},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.5654096007347107},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.5190918445587158},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5107917785644531},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.508761465549469},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.4847649931907654},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.437615305185318},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4299173355102539},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41577354073524475},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3911515474319458},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38741394877433777},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3589598536491394},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24227458238601685},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-003-1046-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-003-1046-1","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":27,"referenced_works":["https://openalex.org/W13547501","https://openalex.org/W53622112","https://openalex.org/W101345945","https://openalex.org/W1561671573","https://openalex.org/W1568927643","https://openalex.org/W1853394109","https://openalex.org/W1965568436","https://openalex.org/W1981934656","https://openalex.org/W1983699268","https://openalex.org/W2000398818","https://openalex.org/W2000946304","https://openalex.org/W2009906570","https://openalex.org/W2021330714","https://openalex.org/W2025306868","https://openalex.org/W2029052362","https://openalex.org/W2042205666","https://openalex.org/W2043572918","https://openalex.org/W2043735243","https://openalex.org/W2074949023","https://openalex.org/W2091376083","https://openalex.org/W2101502605","https://openalex.org/W2101642354","https://openalex.org/W2155239911","https://openalex.org/W2161979975","https://openalex.org/W2164280262","https://openalex.org/W2172137407","https://openalex.org/W3138987285"],"related_works":["https://openalex.org/W2776102956","https://openalex.org/W2183747532","https://openalex.org/W2237480599","https://openalex.org/W2110817230","https://openalex.org/W2002764510","https://openalex.org/W3091355678","https://openalex.org/W1606488336","https://openalex.org/W1685824674","https://openalex.org/W1988569331","https://openalex.org/W2133099431"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}