{"id":"https://openalex.org/W4408117411","doi":"https://doi.org/10.1007/s41109-025-00692-0","title":"An extended analysis of approximation algorithms for k-median problems on complex networks","display_name":"An extended analysis of approximation algorithms for k-median problems on complex networks","publication_year":2025,"publication_date":"2025-03-03","ids":{"openalex":"https://openalex.org/W4408117411","doi":"https://doi.org/10.1007/s41109-025-00692-0"},"language":"en","primary_location":{"id":"doi:10.1007/s41109-025-00692-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s41109-025-00692-0","pdf_url":"https://appliednetsci.springeropen.com/counter/pdf/10.1007/s41109-025-00692-0","source":{"id":"https://openalex.org/S3035517252","display_name":"Applied Network Science","issn_l":"2364-8228","issn":["2364-8228"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Network Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://appliednetsci.springeropen.com/counter/pdf/10.1007/s41109-025-00692-0","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076605665","display_name":"Roldan Pozo","orcid":"https://orcid.org/0000-0002-6239-8726"},"institutions":[{"id":"https://openalex.org/I1321296531","display_name":"National Institute of Standards and Technology","ror":"https://ror.org/05xpvk416","country_code":"US","type":"funder","lineage":["https://openalex.org/I1321296531","https://openalex.org/I1343035065"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Roldan Pozo","raw_affiliation_strings":["National Institute of Standards and Technology, Gaithersburg, MD, 20899, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Standards and Technology, Gaithersburg, MD, 20899, USA","institution_ids":["https://openalex.org/I1321296531"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5076605665"],"corresponding_institution_ids":["https://openalex.org/I1321296531"],"apc_list":{"value":790,"currency":"GBP","value_usd":969},"apc_paid":{"value":790,"currency":"GBP","value_usd":969},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03273662,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11980","display_name":"Human Mobility and Location-Based Analysis","score":0.986299991607666,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11980","display_name":"Human Mobility and Location-Based Analysis","score":0.986299991607666,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9846000075340271,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9721999764442444,"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/algorithm","display_name":"Algorithm","score":0.5767740607261658},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40575018525123596},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4045642018318176}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5767740607261658},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40575018525123596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4045642018318176}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s41109-025-00692-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s41109-025-00692-0","pdf_url":"https://appliednetsci.springeropen.com/counter/pdf/10.1007/s41109-025-00692-0","source":{"id":"https://openalex.org/S3035517252","display_name":"Applied Network Science","issn_l":"2364-8228","issn":["2364-8228"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Network Science","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:bde0572e66464884a8ea3428f5f2f04f","is_oa":true,"landing_page_url":"https://doaj.org/article/bde0572e66464884a8ea3428f5f2f04f","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Applied Network Science, Vol 10, Iss 1, Pp 1-22 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s41109-025-00692-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s41109-025-00692-0","pdf_url":"https://appliednetsci.springeropen.com/counter/pdf/10.1007/s41109-025-00692-0","source":{"id":"https://openalex.org/S3035517252","display_name":"Applied Network Science","issn_l":"2364-8228","issn":["2364-8228"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Network Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4408117411.pdf"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W131619556","https://openalex.org/W2010410498","https://openalex.org/W2018027932","https://openalex.org/W2040763707","https://openalex.org/W2041157860","https://openalex.org/W2061820396","https://openalex.org/W2112090702","https://openalex.org/W2115022330","https://openalex.org/W2133131640","https://openalex.org/W2161728228","https://openalex.org/W2261717057","https://openalex.org/W2962890993","https://openalex.org/W3103633829","https://openalex.org/W4235019172","https://openalex.org/W4239852074","https://openalex.org/W4243557394","https://openalex.org/W4391973719"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2051487156","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596"],"abstract_inverted_index":{"Abstract":[0],"Finding":[1],"the":[2,17,72],"k":[3,13],"-median":[4],"in":[5,24,33,47,161],"a":[6,10,25,48,122,133,146],"network":[7,137],"involves":[8],"identifying":[9],"subset":[11],"of":[12,51,75,112,125,136],"vertices":[14,23],"that":[15,84],"minimize":[16],"total":[18],"distance":[19],"to":[20,44,55,88],"all":[21],"other":[22],"graph.":[26],"This":[27],"problem":[28],"has":[29],"been":[30,64],"extensively":[31],"studied":[32],"computer":[34],"science,":[35],"graph":[36,73],"theory,":[37],"operations":[38],"research,":[39],"and":[40,101,108,115,139,163],"numerous":[41],"areas":[42],"due":[43],"its":[45],"significance":[46],"wide":[49,134],"range":[50,135],"applications.":[52],"While":[53,142],"known":[54],"be":[56,86],"computationally":[57],"challenging":[58],"(NP-hard),":[59],"several":[60],"approximation":[61],"algorithms":[62,95,159],"have":[63],"proposed,":[65],"most":[66],"with":[67,78],"high-order":[68],"polynomial-time":[69],"complexity.":[70],"However,":[71],"topology":[74],"complex":[76,99],"networks":[77,100],"heavy-tailed":[79],"degree":[80],"distributions":[81],"present":[82],"characteristics":[83],"can":[85],"exploited":[87],"yield":[89],"custom-tailored":[90],"algorithms.":[91],"We":[92,153],"compare":[93],"eight":[94],"specifically":[96],"designed":[97],"for":[98,110,167],"evaluate":[102],"their":[103],"performance":[104],"based":[105],"on":[106,121],"accuracy":[107],"efficiency":[109],"problems":[111],"varying":[113],"sizes":[114,138],"application":[116],"areas.":[117],"Rather":[118],"than":[119],"relying":[120],"small":[123],"number":[124],"problems,":[126],"we":[127],"conduct":[128],"over":[129],"20,000":[130],"experiments":[131],"covering":[132],"k-median":[140],"values.":[141],"individual":[143],"results":[144],"vary,":[145],"few":[147],"methods":[148],"provide":[149,164],"consistently":[150],"good":[151],"results.":[152],"draw":[154],"general":[155,165],"conclusions":[156],"about":[157],"how":[158],"perform":[160],"practice":[162],"guidelines":[166],"solutions.":[168]},"counts_by_year":[],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}