{"id":"https://openalex.org/W4399338149","doi":"https://doi.org/10.1145/3626183.3660264","title":"Brief Announcement: Minimizing the Weighted Average Shortest Path Length in Demand-Aware Networks via Matching Augmentation","display_name":"Brief Announcement: Minimizing the Weighted Average Shortest Path Length in Demand-Aware Networks via Matching Augmentation","publication_year":2024,"publication_date":"2024-06-04","ids":{"openalex":"https://openalex.org/W4399338149","doi":"https://doi.org/10.1145/3626183.3660264"},"language":"en","primary_location":{"id":"doi:10.1145/3626183.3660264","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3626183.3660264","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-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/A5090225461","display_name":"Aleksander Figiel","orcid":"https://orcid.org/0009-0003-9874-4795"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Aleksander Figiel","raw_affiliation_strings":["TU Berlin, Berlin, Germany"],"raw_orcid":"https://orcid.org/0009-0003-9874-4795","affiliations":[{"raw_affiliation_string":"TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073900481","display_name":"Darya Melnyk","orcid":"https://orcid.org/0000-0001-5614-8563"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Darya Melnyk","raw_affiliation_strings":["TU Berlin, Berlin, Germany"],"raw_orcid":"https://orcid.org/0000-0001-5614-8563","affiliations":[{"raw_affiliation_string":"TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012560459","display_name":"Andr\u00e9 Nichterlein","orcid":"https://orcid.org/0000-0001-7451-9401"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andr\u00e9 Nichterlein","raw_affiliation_strings":["TU Berlin, Berlin, Germany"],"raw_orcid":"https://orcid.org/0000-0001-7451-9401","affiliations":[{"raw_affiliation_string":"TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082991441","display_name":"Arash Pourdamghani","orcid":"https://orcid.org/0000-0002-9213-1512"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Arash Pourdamghani","raw_affiliation_strings":["TU Berlin, Berlin, Germany"],"raw_orcid":"https://orcid.org/0000-0002-9213-1512","affiliations":[{"raw_affiliation_string":"TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066080641","display_name":"Stefan Schmid","orcid":"https://orcid.org/0000-0002-7798-1711"},"institutions":[{"id":"https://openalex.org/I4210133470","display_name":"Fraunhofer Institute for Secure Information Technology","ror":"https://ror.org/03qt2gs44","country_code":"DE","type":"facility","lineage":["https://openalex.org/I4210133470","https://openalex.org/I4923324"]},{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Schmid","raw_affiliation_strings":["TU Berlin & Fraunhofer SIT, Berlin, Germany"],"raw_orcid":"https://orcid.org/0000-0002-7798-1711","affiliations":[{"raw_affiliation_string":"TU Berlin & Fraunhofer SIT, Berlin, Germany","institution_ids":["https://openalex.org/I4210133470","https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07310901,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"447","last_page":"449"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9988999962806702,"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.9988999962806702,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9959999918937683,"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/T12288","display_name":"Optimization and Search Problems","score":0.9954000115394592,"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/computer-science","display_name":"Computer science","score":0.6380478143692017},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6280893087387085},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5792688727378845},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.472636878490448},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.415114164352417},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2504803538322449},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23065954446792603},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22083598375320435},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10118621587753296},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08526620268821716}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6380478143692017},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6280893087387085},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5792688727378845},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.472636878490448},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.415114164352417},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2504803538322449},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23065954446792603},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22083598375320435},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10118621587753296},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08526620268821716}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3626183.3660264","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3626183.3660264","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:null:publica/475613","is_oa":false,"landing_page_url":"https://publica.fraunhofer.de/handle/publica/475613","pdf_url":null,"source":{"id":"https://openalex.org/S4306400318","display_name":"Fraunhofer-Publica (Fraunhofer-Gesellschaft)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4923324","host_organization_name":"Fraunhofer-Gesellschaft","host_organization_lineage":["https://openalex.org/I4923324"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"conference paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2933675886","display_name":null,"funder_award_id":"864228","funder_id":"https://openalex.org/F4320323817","funder_display_name":"Universitas Brawijaya"}],"funders":[{"id":"https://openalex.org/F4320323817","display_name":"Universitas Brawijaya","ror":"https://ror.org/01wk3d929"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1819194591","https://openalex.org/W1988150362","https://openalex.org/W2053572557","https://openalex.org/W2128678576","https://openalex.org/W3006074501","https://openalex.org/W3144786718","https://openalex.org/W4221148769","https://openalex.org/W4315588659","https://openalex.org/W4318812733","https://openalex.org/W4388662009"],"related_works":["https://openalex.org/W2129816636","https://openalex.org/W2129550502","https://openalex.org/W2009808060","https://openalex.org/W2093961518","https://openalex.org/W2372801012","https://openalex.org/W2898676476","https://openalex.org/W2009843927","https://openalex.org/W2361133696","https://openalex.org/W2102269193","https://openalex.org/W1602184149"],"abstract_inverted_index":{"Graph":[0],"augmentation":[1],"is":[2,46,108],"a":[3,15,32,80,86,89,94,114],"fundamental":[4],"and":[5,36,112,137,143],"well-studied":[6],"problem":[7,107],"that":[8,118,139],"arises":[9],"in":[10,91,97],"network":[11,35,76,99,126],"optimization.":[12],"We":[13,71,128],"consider":[14],"new":[16],"variant":[17],"of":[18,66,69,116],"this":[19,27],"model":[20],"motivated":[21],"by":[22],"reconfigurable":[23],"communication":[24,39,64,135],"networks.":[25],"In":[26],"variant,":[28],"we":[29,110,146],"differentiate":[30],"between":[31,41],"given":[33],"physical":[34],"the":[37,42,49,59,63,98,103,106],"measured":[38],"demands":[40],"nodes.":[43,70],"Our":[44],"goal":[45],"to":[47,62,78,149],"minimize":[48],"weighted":[50],"average":[51],"shortest":[52],"path":[53],"length":[54],"via":[55],"matching":[56,87],"augmentation,":[57],"where":[58],"weights":[60],"correspond":[61],"frequency":[65],"any":[67],"pair":[68],"use":[72],"results":[73],"from":[74],"demand-aware":[75],"design":[77,111],"provide":[79],"constant-factor":[81],"approximation":[82],"algorithm":[83],"for":[84],"adding":[85],"on":[88,132],"ring":[90],"case":[92],"only":[93],"few":[95],"nodes":[96],"cause":[100],"almost":[101],"all":[102],"communication.":[104],"Since":[105],"NP-hard,":[109],"evaluate":[113,129],"series":[115],"heuristics":[117,131,145],"can":[119],"deal":[120],"with":[121,141],"arbitrary":[122],"graphs":[123],"as":[124],"underlying":[125],"structures.":[127],"our":[130],"general":[133],"real-world":[134],"patterns":[136],"show":[138],"already":[140],"simple":[142],"efficient":[144],"are":[147],"able":[148],"reach":[150],"near-optimal":[151],"quality.":[152]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}