{"id":"https://openalex.org/W1814265121","doi":"https://doi.org/10.1007/978-3-319-08001-7_14","title":"Counting Approximately-Shortest Paths in Directed Acyclic Graphs","display_name":"Counting Approximately-Shortest Paths in Directed Acyclic Graphs","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W1814265121","doi":"https://doi.org/10.1007/978-3-319-08001-7_14","mag":"1814265121"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-08001-7_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-08001-7_14","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":"conference-paper","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/A5038083135","display_name":"Mat\u00fa\u0161 Miha\u013e\u00e1k","orcid":"https://orcid.org/0000-0002-1898-607X"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Mat\u00fa\u0161 Mihal\u00e1k","raw_affiliation_strings":["Institute of Theoretical Computer Science, ETH Zurich, Zurich, Switzerland","[ETH, Zurich]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Theoretical Computer Science, ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"[ETH, Zurich]","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017541388","display_name":"Rastislav \u0160r\u00e1mek","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Rastislav \u0160r\u00e1mek","raw_affiliation_strings":["[ETH, Zurich]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[ETH, Zurich]","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109904634","display_name":"Peter Widmayer","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Peter Widmayer","raw_affiliation_strings":["Institute of Theoretical Computer Science, ETH Zurich, Zurich, Switzerland","[ETH, Zurich]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Theoretical Computer Science, ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"[ETH, Zurich]","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.8488,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.88603696,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"156","last_page":"167"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.993399977684021,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6808369755744934},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5697537660598755},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5231417417526245},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.47635650634765625},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.47232288122177124},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.466104120016098},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46527358889579773},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4533109962940216},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4360954761505127},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.43447864055633545},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4281196892261505},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4127000570297241},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31079673767089844},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.21254613995552063},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.20941871404647827}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6808369755744934},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5697537660598755},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5231417417526245},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.47635650634765625},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.47232288122177124},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.466104120016098},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46527358889579773},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4533109962940216},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4360954761505127},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.43447864055633545},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4281196892261505},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4127000570297241},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31079673767089844},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.21254613995552063},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.20941871404647827},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-319-08001-7_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-08001-7_14","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"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire_cris_publications/bfcf5aff-b434-4fdd-9d8c-57098a42a033","is_oa":false,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/bfcf5aff-b434-4fdd-9d8c-57098a42a033","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mihal\u00e1k, M, \u0160r\u00e1mek, R & Widmayer, P 2013, Counting Approximately-Shortest Paths in Directed Acyclic Graphs. in Proc. 11th International Workshop on Approximation and Online Algorithms (WAOA). Springer Verlag, Lecture Notes in Computer Science, vol. 8447, pp. 156-167. https://doi.org/10.1007/978-3-319-08001-7_14","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1497494381","https://openalex.org/W1814265121","https://openalex.org/W1977004736","https://openalex.org/W1978245109","https://openalex.org/W1985985425","https://openalex.org/W1986511870","https://openalex.org/W1987325064","https://openalex.org/W1989921461","https://openalex.org/W2006912660","https://openalex.org/W2009570821","https://openalex.org/W2019932401","https://openalex.org/W2115826669","https://openalex.org/W2135756775","https://openalex.org/W2166187656","https://openalex.org/W2401610261","https://openalex.org/W3136323740","https://openalex.org/W4237887428","https://openalex.org/W4245668478","https://openalex.org/W4254702493"],"related_works":["https://openalex.org/W2146569528","https://openalex.org/W1998712144","https://openalex.org/W4287028074","https://openalex.org/W2106828717","https://openalex.org/W3191289342","https://openalex.org/W4300165677","https://openalex.org/W4293167680","https://openalex.org/W4297817344","https://openalex.org/W4292730466","https://openalex.org/W2372211403"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}