{"id":"https://openalex.org/W4388769685","doi":"https://doi.org/10.1142/s0129054123500235","title":"Approximating Minimum k-Tree Cover of a Connected Graph Inspired by the Multi-Ferry Routing in Delay Tolerant Networks","display_name":"Approximating Minimum k-Tree Cover of a Connected Graph Inspired by the Multi-Ferry Routing in Delay Tolerant Networks","publication_year":2023,"publication_date":"2023-11-16","ids":{"openalex":"https://openalex.org/W4388769685","doi":"https://doi.org/10.1142/s0129054123500235"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054123500235","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1142/s0129054123500235","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5087923932","display_name":"Satoshi Fujita","orcid":"https://orcid.org/0000-0001-9412-7309"},"institutions":[{"id":"https://openalex.org/I113306721","display_name":"Hiroshima University","ror":"https://ror.org/03t78wx29","country_code":"JP","type":"education","lineage":["https://openalex.org/I113306721"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Fujita Satoshi","raw_affiliation_strings":["Department of Information Engineering, Hiroshima University, Kagamiyama 1-4-1, Higashi-Hiroshima, 739-8527, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Information Engineering, Hiroshima University, Kagamiyama 1-4-1, Higashi-Hiroshima, 739-8527, Japan","institution_ids":["https://openalex.org/I113306721"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5087923932"],"corresponding_institution_ids":["https://openalex.org/I113306721"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18105975,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"16"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9991000294685364,"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/T13553","display_name":"Age of Information Optimization","score":0.996999979019165,"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/T11478","display_name":"Caching and Content Delivery","score":0.9868999719619751,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7162532806396484},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.6511439085006714},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.6253055930137634},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5959891080856323},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5866039991378784},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5710881352424622},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.5683872699737549},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5679024457931519},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5299122333526611},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4867877662181854},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.47662293910980225},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.465457946062088},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.46183064579963684},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4613182246685028},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.45209887623786926},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.4519394040107727},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4412704408168793},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38932159543037415},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.31458497047424316},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2991737723350525},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.28897297382354736}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7162532806396484},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.6511439085006714},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.6253055930137634},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5959891080856323},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5866039991378784},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5710881352424622},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.5683872699737549},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5679024457931519},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5299122333526611},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4867877662181854},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.47662293910980225},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.465457946062088},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.46183064579963684},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4613182246685028},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.45209887623786926},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.4519394040107727},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4412704408168793},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38932159543037415},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31458497047424316},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2991737723350525},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.28897297382354736},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054123500235","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1142/s0129054123500235","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.4000000059604645,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1968512292","https://openalex.org/W1973984239","https://openalex.org/W2004979544","https://openalex.org/W2005634807","https://openalex.org/W2011039300","https://openalex.org/W2012226875","https://openalex.org/W2055569927","https://openalex.org/W2055654205","https://openalex.org/W2060460330","https://openalex.org/W2068263040","https://openalex.org/W2081534709","https://openalex.org/W2099574482","https://openalex.org/W2124651399","https://openalex.org/W2157457404","https://openalex.org/W2157999977","https://openalex.org/W2327315803","https://openalex.org/W2561675875","https://openalex.org/W2614098644","https://openalex.org/W2756932338","https://openalex.org/W2784274235","https://openalex.org/W3098592570","https://openalex.org/W3167350281"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2054473698","https://openalex.org/W2943635264","https://openalex.org/W2138987445","https://openalex.org/W2108073487","https://openalex.org/W2952019673","https://openalex.org/W2155234080","https://openalex.org/W136930855","https://openalex.org/W4388769685","https://openalex.org/W2040482710"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,63],"consider":[4],"the":[5,9,25,29,35,48,57,66,80,90,93,97,118,124,128],"problem":[6,38],"of":[7,12,28,34,51,99,120],"covering":[8],"vertex":[10],"set":[11],"a":[13,32,52,108],"given":[14],"graph":[15,139],"by":[16,40],"[Formula:":[17,75],"see":[18,76],"text]":[19,77],"trees":[20],"so":[21,86],"as":[22,31,87],"to":[23,88],"minimize":[24,89],"maximum":[26,94],"weight":[27,95],"trees,":[30],"subproblem":[33],"multi-ferry":[36],"scheduling":[37],"proposed":[39],"Zhao":[41],"and":[42],"Ammar.":[43],"After":[44],"pointing":[45],"out":[46],"that":[47,65],"approximation":[49,67,110],"ratio":[50,68],"greedy":[53],"scheme":[54],"based":[55],"on":[56],"Kruskal\u2019s":[58],"algorithm":[59,114,133],"is":[60,84],"provably":[61],"bad,":[62],"show":[64],"cannot":[69],"be":[70],"better":[71],"than":[72],"3/2":[73],"for":[74,117,136],"even":[78],"when":[79],"edge":[81,125,142],"selection":[82],"criterion":[83],"modified":[85],"increase":[91],"in":[92,96,122],"collection":[98],"trees.":[100],"We":[101],"then":[102],"propose":[103],"two":[104],"polynomial-time":[105],"algorithms":[106],"with":[107,140],"guaranteed":[109],"ratio.":[111],"The":[112,131],"first":[113],"achieves":[115,134],"3-approximation":[116],"class":[119],"graphs":[121],"which":[123],"weights":[126],"satisfy":[127],"triangle":[129],"inequality.":[130],"second":[132],"4-approximation":[135],"any":[137],"connected":[138],"arbitrary":[141],"weights.":[143]},"counts_by_year":[],"updated_date":"2025-12-25T23:11:45.687758","created_date":"2025-10-10T00:00:00"}