{"id":"https://openalex.org/W2229053133","doi":"https://doi.org/10.14778/2732951.2732963","title":"On k-path covers and their applications","display_name":"On k-path covers and their applications","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2229053133","doi":"https://doi.org/10.14778/2732951.2732963","mag":"2229053133"},"language":"en","primary_location":{"id":"doi:10.14778/2732951.2732963","is_oa":false,"landing_page_url":"https://doi.org/10.14778/2732951.2732963","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","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/A5108747743","display_name":"Stefan Funke","orcid":null},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Funke","raw_affiliation_strings":["Universit\u00e4t Stuttgart Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Stuttgart Germany","institution_ids":["https://openalex.org/I100066346"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050906094","display_name":"Andr\u00e9 Nusser","orcid":"https://orcid.org/0000-0002-6349-869X"},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andr\u00e9 Nusser","raw_affiliation_strings":["Universit\u00e4t Stuttgart Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Stuttgart Germany","institution_ids":["https://openalex.org/I100066346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027517542","display_name":"Sabine Storandt","orcid":"https://orcid.org/0000-0001-5411-3834"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sabine Storandt","raw_affiliation_strings":["Universit\u00e4t Freiburg Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Freiburg Germany","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.0766,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.97751013,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"7","issue":"10","first_page":"893","last_page":"902"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9990000128746033,"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/T13282","display_name":"Automated Road and Building Extraction","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/computer-science","display_name":"Computer science","score":0.7077685594558716},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6320885419845581},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6268141865730286},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5381743311882019},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5301108360290527},{"id":"https://openalex.org/keywords/overlay-network","display_name":"Overlay network","score":0.5116639137268066},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49312707781791687},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.486489474773407},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4736524820327759},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4717608094215393},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4399120509624481},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2214512825012207},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.12073075771331787},{"id":"https://openalex.org/keywords/world-wide-web","display_name":"World Wide Web","score":0.09973788261413574},{"id":"https://openalex.org/keywords/the-internet","display_name":"The Internet","score":0.09061390161514282}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7077685594558716},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6320885419845581},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6268141865730286},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5381743311882019},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5301108360290527},{"id":"https://openalex.org/C169851745","wikidata":"https://www.wikidata.org/wiki/Q1331985","display_name":"Overlay network","level":3,"score":0.5116639137268066},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49312707781791687},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.486489474773407},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4736524820327759},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4717608094215393},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4399120509624481},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2214512825012207},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.12073075771331787},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.09973788261413574},{"id":"https://openalex.org/C110875604","wikidata":"https://www.wikidata.org/wiki/Q75","display_name":"The Internet","level":2,"score":0.09061390161514282},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","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},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.14778/2732951.2732963","is_oa":false,"landing_page_url":"https://doi.org/10.14778/2732951.2732963","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.4699999988079071,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W30435042","https://openalex.org/W83351988","https://openalex.org/W85521454","https://openalex.org/W122384246","https://openalex.org/W282961531","https://openalex.org/W833447691","https://openalex.org/W1904636577","https://openalex.org/W1920501755","https://openalex.org/W2022671649","https://openalex.org/W2029538739","https://openalex.org/W2052790720","https://openalex.org/W2055721472","https://openalex.org/W2072485026","https://openalex.org/W2083019227","https://openalex.org/W2112513979","https://openalex.org/W2120358419","https://openalex.org/W2126021606","https://openalex.org/W2137118456","https://openalex.org/W2143083884","https://openalex.org/W2262197264","https://openalex.org/W4238284510"],"related_works":["https://openalex.org/W4388311650","https://openalex.org/W1974056099","https://openalex.org/W4245343541","https://openalex.org/W2386077341","https://openalex.org/W563589758","https://openalex.org/W5922282","https://openalex.org/W2954004777","https://openalex.org/W2949638731","https://openalex.org/W2951102138","https://openalex.org/W2015381354"],"abstract_inverted_index":{"For":[0],"a":[1,11,16,22,67,109,132],"directed":[2],"graph":[3,65],"G":[4,72],"with":[5,48],"vertex":[6],"set":[7,59],"V":[8,15],"we":[9,115],"call":[10],"subset":[12],"C":[13,20,60],"\u2286":[14],"k-(All-)Path":[17],"Cover":[18],"if":[19],"contains":[21],"node":[23],"from":[24,108],"any":[25],"path":[26,86],"consisting":[27],"of":[28,36,45,50,71,91,100,112],"k":[29,39,123],"nodes.":[30],"This":[31],"paper":[32],"considers":[33],"the":[34,43,58,75,78,113],"problem":[35],"constructing":[37],"small":[38,122],"-Path":[40,124],"Covers":[41,125],"in":[42,103],"context":[44],"road":[46,129],"networks":[47,130],"millions":[49],"nodes":[51],"and":[52,61,94,98],"edges.":[53],"In":[54],"many":[55],"application":[56],"scenarios":[57],"its":[62],"induced":[63],"overlay":[64],"constitute":[66],"very":[68,121],"compact":[69],"synopsis":[70],"which":[73],"is":[74],"basis":[76],"for":[77,83,126],"currently":[79],"fastest":[80],"data":[81,102],"structure":[82],"personalized":[84],"shortest":[85],"queries,":[87],"visually":[88],"pleasing":[89],"overlays":[90],"subsampled":[92],"paths,":[93],"efficient":[95,117],"reporting,":[96],"retrieval":[97],"aggregation":[99],"associated":[101],"spatial":[104],"network":[105],"databases.":[106],"Apart":[107],"theoretical":[110],"investigation":[111],"problem,":[114],"provide":[116],"algorithms":[118],"that":[119],"produce":[120],"large":[127],"real-world":[128],"(with":[131],"posteriori":[133],"guarantees":[134],"via":[135],"instance-based":[136],"lower":[137],"bounds).":[138]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}