{"id":"https://openalex.org/W2609697785","doi":"https://doi.org/10.1587/transinf.2016edp7398","title":"An Efficient Approximate Algorithm for the 1-Median Problem on a Graph","display_name":"An Efficient Approximate Algorithm for the 1-Median Problem on a Graph","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2609697785","doi":"https://doi.org/10.1587/transinf.2016edp7398","mag":"2609697785"},"language":"en","primary_location":{"id":"doi:10.1587/transinf.2016edp7398","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2016edp7398","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E100.D/5/E100.D_2016EDP7398/_pdf","source":{"id":"https://openalex.org/S2486202937","display_name":"IEICE Transactions on Information and Systems","issn_l":"0916-8532","issn":["0916-8532","1745-1361"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Information and Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.jstage.jst.go.jp/article/transinf/E100.D/5/E100.D_2016EDP7398/_pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100915736","display_name":"Koji Tabata","orcid":null},"institutions":[{"id":"https://openalex.org/I205349734","display_name":"Hokkaido University","ror":"https://ror.org/02e16g702","country_code":"JP","type":"education","lineage":["https://openalex.org/I205349734"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Koji TABATA","raw_affiliation_strings":["Graduate School of Information Science and Technology, Hokkaido University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology, Hokkaido University","institution_ids":["https://openalex.org/I205349734"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067632149","display_name":"Atsuyoshi Nakamura","orcid":"https://orcid.org/0000-0001-7078-8655"},"institutions":[{"id":"https://openalex.org/I205349734","display_name":"Hokkaido University","ror":"https://ror.org/02e16g702","country_code":"JP","type":"education","lineage":["https://openalex.org/I205349734"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Atsuyoshi NAKAMURA","raw_affiliation_strings":["Graduate School of Information Science and Technology, Hokkaido University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology, Hokkaido University","institution_ids":["https://openalex.org/I205349734"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078972540","display_name":"Mineichi Kudo","orcid":"https://orcid.org/0000-0003-1013-3870"},"institutions":[{"id":"https://openalex.org/I205349734","display_name":"Hokkaido University","ror":"https://ror.org/02e16g702","country_code":"JP","type":"education","lineage":["https://openalex.org/I205349734"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Mineichi KUDO","raw_affiliation_strings":["Graduate School of Information Science and Technology, Hokkaido University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology, Hokkaido University","institution_ids":["https://openalex.org/I205349734"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I205349734"],"apc_list":null,"apc_paid":null,"fwci":2.3953,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.89458657,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"E100.D","issue":"5","first_page":"994","last_page":"1002"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9891999959945679,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/centrality","display_name":"Centrality","score":0.7046210169792175},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6908049583435059},{"id":"https://openalex.org/keywords/closeness","display_name":"Closeness","score":0.6619623303413391},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5508829355239868},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5291619300842285},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5007438659667969},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4965367913246155},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.42547911405563354},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42432159185409546},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.41118547320365906},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36489957571029663}],"concepts":[{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.7046210169792175},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6908049583435059},{"id":"https://openalex.org/C2779545769","wikidata":"https://www.wikidata.org/wiki/Q5135364","display_name":"Closeness","level":2,"score":0.6619623303413391},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5508829355239868},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5291619300842285},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5007438659667969},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4965367913246155},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.42547911405563354},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42432159185409546},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.41118547320365906},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36489957571029663},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1587/transinf.2016edp7398","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2016edp7398","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E100.D/5/E100.D_2016EDP7398/_pdf","source":{"id":"https://openalex.org/S2486202937","display_name":"IEICE Transactions on Information and Systems","issn_l":"0916-8532","issn":["0916-8532","1745-1361"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Information and Systems","raw_type":"journal-article"},{"id":"pmh:oai:irdb.nii.ac.jp:01364:0007181845","is_oa":true,"landing_page_url":"https://hdl.handle.net/2115/66184","pdf_url":"https://eprints.lib.hokudai.ac.jp/repo/huscap/all/66184/E100.D_2016EDP7398.pdf","source":{"id":"https://openalex.org/S7407056385","display_name":"Institutional Repositories DataBase (IRDB)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I184597095","host_organization_name":"National Institute of Informatics","host_organization_lineage":["https://openalex.org/I184597095"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEICE transactions on information and systems","raw_type":"journal article"},{"id":"pmh:oai:eprints.lib.hokudai.ac.jp:2115/66184","is_oa":false,"landing_page_url":"http://hdl.handle.net/2115/66184","pdf_url":null,"source":{"id":"https://openalex.org/S4306400549","display_name":"Hokkaido University Collection of Scholarly and Academic Papers (Hokkaido University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205349734","host_organization_name":"Hokkaido University","host_organization_lineage":["https://openalex.org/I205349734"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1587/transinf.2016edp7398","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2016edp7398","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E100.D/5/E100.D_2016EDP7398/_pdf","source":{"id":"https://openalex.org/S2486202937","display_name":"IEICE Transactions on Information and Systems","issn_l":"0916-8532","issn":["0916-8532","1745-1361"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Information and Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2609697785.pdf","grobid_xml":"https://content.openalex.org/works/W2609697785.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W12382059","https://openalex.org/W88032150","https://openalex.org/W1512223465","https://openalex.org/W1536060130","https://openalex.org/W1984953641","https://openalex.org/W1999545213","https://openalex.org/W2022980325","https://openalex.org/W2044004084","https://openalex.org/W2056944867","https://openalex.org/W2084224084","https://openalex.org/W2102750402","https://openalex.org/W2166964471","https://openalex.org/W2167262444","https://openalex.org/W2171350309","https://openalex.org/W2567974767"],"related_works":["https://openalex.org/W3110381201","https://openalex.org/W1531601525","https://openalex.org/W3204684126","https://openalex.org/W3117290964","https://openalex.org/W1594413663","https://openalex.org/W189401716","https://openalex.org/W2019216770","https://openalex.org/W2574250816","https://openalex.org/W2898570308","https://openalex.org/W2544904580"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,18,27,36],"heuristic":[3],"approximation":[4,98,115],"algorithm":[5,32,78,99,112],"for":[6],"the":[7,14,21,86,96,104,107],"1-median":[8,11],"problem.":[9],"The":[10],"problem":[12,15],"is":[13,79],"of":[16,47],"finding":[17],"vertex":[19,37,49],"with":[20,38,62,72],"highest":[22],"closeness":[23,40,45],"centrality.":[24],"Starting":[25],"from":[26],"randomly":[28],"selected":[29],"vertex,":[30],"our":[31,66,77,111],"repeats":[33],"to":[34,65,103],"find":[35],"higher":[39,114],"centrality":[41,46],"by":[42,110],"approximately":[43],"calculating":[44],"each":[48],"using":[50,69,100],"simpler":[51],"spanning":[52],"subgraphs,":[53],"which":[54],"are":[55],"called":[56],"k-neighbor":[57],"dense":[58],"shortest":[59],"path":[60],"graphs":[61],"shortcuts.":[63],"According":[64],"experimental":[67],"results":[68],"real":[70],"networks":[71],"more":[73,80,90],"than":[74,81,85,91,95],"10,000":[75],"vertices,":[76],"100":[82],"times":[83,93],"faster":[84,94],"exhaustive":[87],"search":[88],"and":[89],"20":[92],"state-of-the-art":[97],"annotated":[101],"information":[102],"vertices":[105],"while":[106],"solutions":[108],"output":[109],"have":[113],"ratio.":[116]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}