{"id":"https://openalex.org/W2512030869","doi":"https://doi.org/10.1145/2980523.2980528","title":"Integer programming approach for directed minimum spanning tree problem on temporal graphs","display_name":"Integer programming approach for directed minimum spanning tree problem on temporal graphs","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2512030869","doi":"https://doi.org/10.1145/2980523.2980528","mag":"2512030869"},"language":"en","primary_location":{"id":"doi:10.1145/2980523.2980528","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2980523.2980528","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1st ACM SIGMOD Workshop on Network Data Analytics","raw_type":"proceedings-article"},"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/A5006950142","display_name":"Takuto Ikuta","orcid":null},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takuto Ikuta","raw_affiliation_strings":["The University of Tokyo, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Tokyo, Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102966470","display_name":"Takuya Akiba","orcid":"https://orcid.org/0000-0002-8284-4375"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takuya Akiba","raw_affiliation_strings":["National Institute of Informatics, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Informatics, Tokyo, Japan","institution_ids":["https://openalex.org/I184597095"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.07706954,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9994999766349792,"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/T11478","display_name":"Caching and Content Delivery","score":0.9994999766349792,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9987999796867371,"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/T11106","display_name":"Data Management and Algorithms","score":0.9983000159263611,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6939718127250671},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5185214281082153},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5093597173690796},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.44746196269989014},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43803641200065613},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25848132371902466},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2217940092086792},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2002851963043213}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6939718127250671},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5185214281082153},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5093597173690796},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.44746196269989014},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43803641200065613},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25848132371902466},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2217940092086792},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2002851963043213}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2980523.2980528","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2980523.2980528","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1st ACM SIGMOD Workshop on Network Data Analytics","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W16274536","https://openalex.org/W132245160","https://openalex.org/W205317713","https://openalex.org/W1606547772","https://openalex.org/W1965680834","https://openalex.org/W1968497507","https://openalex.org/W1968594877","https://openalex.org/W1982512167","https://openalex.org/W2011039300","https://openalex.org/W2017927472","https://openalex.org/W2022132320","https://openalex.org/W2037403365","https://openalex.org/W2049287714","https://openalex.org/W2055518297","https://openalex.org/W2061820396","https://openalex.org/W2074613642","https://openalex.org/W2086863198","https://openalex.org/W2155239253","https://openalex.org/W2169528473","https://openalex.org/W2218562164","https://openalex.org/W2244843312","https://openalex.org/W2438284930","https://openalex.org/W2949726863","https://openalex.org/W3014094413","https://openalex.org/W4246185962"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W2044443696","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181","https://openalex.org/W3081212354"],"abstract_inverted_index":{"Considerable":[0],"effort":[1],"has":[2,23],"been":[3],"devoted":[4],"to":[5,92],"establishing":[6],"concepts":[7],"and":[8,47],"designing":[9],"algorithms":[10,100,110],"that":[11,107],"are":[12,29],"useful":[13],"for":[14,55,60],"graph":[15],"data":[16],"management.":[17],"While":[18],"most":[19,52],"work":[20],"so":[21],"far":[22],"focused":[24],"on":[25,73],"static":[26,56],"graphs,":[27,37,75],"there":[28],"many":[30],"networks":[31],"with":[32],"time":[33],"information,":[34],"i.e.,":[35],"temporal":[36,61,74],"such":[38],"as":[39],"social":[40],"network":[41],"messages,":[42],"phone":[43],"calls,":[44],"public":[45],"transportation,":[46],"neural":[48],"networks.":[49],"Even":[50,86],"the":[51,68,108],"fundamental":[53],"problems":[54],"graphs":[57],"become":[58],"non-trivial":[59],"graphs.":[62],"In":[63],"this":[64,88],"paper,":[65],"we":[66,95],"explore":[67],"minimum-weight":[69],"spanning":[70],"tree":[71],"problem":[72,89],"which":[76],"was":[77],"recently":[78],"proposed":[79,109,118],"by":[80],"Huang":[81],"et":[82],"al.":[83],"[SIGMOD":[84],"2015].":[85],"though":[87],"is":[90],"proven":[91],"be":[93],"NP-hard,":[94],"design":[96],"practically":[97],"efficient":[98],"exact":[99],"using":[101],"integer":[102],"programming.":[103],"Experimental":[104],"results":[105],"confirm":[106],"can":[111],"produce":[112],"better":[113],"solutions":[114],"than":[115],"a":[116],"previously":[117],"approximation":[119],"algorithm.":[120]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}