{"id":"https://openalex.org/W1804374324","doi":"https://doi.org/10.1007/978-3-642-04802-9_11","title":"Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem","display_name":"Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1804374324","doi":"https://doi.org/10.1007/978-3-642-04802-9_11","mag":"1804374324"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-04802-9_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-04802-9_11","pdf_url":null,"source":{"id":"https://openalex.org/S4210185096","display_name":"IFIP advances in information and communication technology","issn_l":"1868-422X","issn":["1868-422X","1868-4238"],"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":"IFIP Advances in Information and Communication Technology","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/A5070111118","display_name":"Jacek Czekaj","orcid":null},"institutions":[{"id":"https://openalex.org/I4210086947","display_name":"Institute of Physics","ror":"https://ror.org/000sfad56","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210086947","https://openalex.org/I99542240"]},{"id":"https://openalex.org/I864159182","display_name":"University of Silesia in Katowice","ror":"https://ror.org/0104rcc94","country_code":"PL","type":"education","lineage":["https://openalex.org/I864159182"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Jacek Czekaj","raw_affiliation_strings":["Institute of Physics, University of Silesia, 4\u00a0Uniwersytecka\u00a0St., 40-007, Katowice, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Physics, University of Silesia, 4\u00a0Uniwersytecka\u00a0St., 40-007, Katowice, Poland","institution_ids":["https://openalex.org/I864159182","https://openalex.org/I4210086947"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033874688","display_name":"L. Socha","orcid":"https://orcid.org/0000-0003-0701-9700"},"institutions":[{"id":"https://openalex.org/I69984877","display_name":"Cardinal Stefan Wyszy\u0144ski University in Warsaw","ror":"https://ror.org/05sdyjv16","country_code":"PL","type":"education","lineage":["https://openalex.org/I69984877"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Les\u0142aw Socha","raw_affiliation_strings":["Faculty of Mathematics and Natural Sciences, College of Sciences, Cardinal Stefan Wyszy\u0144ski University in Warsaw, 5\u00a0Dewajtis St., 01-815, Warszawa, Poland"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Natural Sciences, College of Sciences, Cardinal Stefan Wyszy\u0144ski University in Warsaw, 5\u00a0Dewajtis St., 01-815, Warszawa, Poland","institution_ids":["https://openalex.org/I69984877"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5070111118"],"corresponding_institution_ids":["https://openalex.org/I4210086947","https://openalex.org/I864159182"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.16274752,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"220","last_page":"238"},"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.9993000030517578,"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.9993000030517578,"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/T12288","display_name":"Optimization and Search Problems","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7355379462242126},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.6019201278686523},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5521560311317444},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5342357158660889},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5326907634735107},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5166104435920715},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4580248296260834},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.45724251866340637},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4126873314380646},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3575931787490845},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34493502974510193},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.23335251212120056},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13058608770370483}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7355379462242126},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.6019201278686523},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5521560311317444},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5342357158660889},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5326907634735107},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5166104435920715},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4580248296260834},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.45724251866340637},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4126873314380646},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3575931787490845},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34493502974510193},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.23335251212120056},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13058608770370483},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-04802-9_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-04802-9_11","pdf_url":null,"source":{"id":"https://openalex.org/S4210185096","display_name":"IFIP advances in information and communication technology","issn_l":"1868-422X","issn":["1868-422X","1868-4238"],"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":"IFIP Advances in Information and Communication Technology","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.623.9884","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.623.9884","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ifip2007.agh.edu.pl/abstracts/182.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W119169328","https://openalex.org/W1480013811","https://openalex.org/W1977545325","https://openalex.org/W2001158995","https://openalex.org/W2004635739","https://openalex.org/W2007572995","https://openalex.org/W2022980325","https://openalex.org/W2054523876","https://openalex.org/W2056723044","https://openalex.org/W2060882019","https://openalex.org/W2062014422","https://openalex.org/W2065693291","https://openalex.org/W2084224084","https://openalex.org/W2099466544","https://openalex.org/W2120424341","https://openalex.org/W2123784360","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2313838118","https://openalex.org/W2752885492","https://openalex.org/W3145128584"],"related_works":["https://openalex.org/W2018146256","https://openalex.org/W2776102956","https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W2237480599","https://openalex.org/W2388410942","https://openalex.org/W2365712669","https://openalex.org/W2612665926","https://openalex.org/W4294360851","https://openalex.org/W2020255949"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}