{"id":"https://openalex.org/W2994865291","doi":"https://doi.org/10.1145/3368926.3369722","title":"Balanced landmark-based graph partitioning with application in navigating with limited resources","display_name":"Balanced landmark-based graph partitioning with application in navigating with limited resources","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2994865291","doi":"https://doi.org/10.1145/3368926.3369722","mag":"2994865291"},"language":"en","primary_location":{"id":"doi:10.1145/3368926.3369722","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3368926.3369722","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Tenth International Symposium on Information and Communication Technology  - SoICT 2019","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/A5010194618","display_name":"Chi-Hieu Nguyen","orcid":"https://orcid.org/0009-0002-6903-0163"},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":true,"raw_author_name":"Chi-Hieu Nguyen","raw_affiliation_strings":["School of Information and Communication Technology, Ha Noi University of Science Technology, Ha Noi, Viet Nam"],"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, Ha Noi University of Science Technology, Ha Noi, Viet Nam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033964491","display_name":"Khanh-Van Nguyen","orcid":"https://orcid.org/0000-0002-3009-3135"},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Khanh-Van Nguyen","raw_affiliation_strings":["School of Information and Communication Technology, Ha Noi University of Science Technology, Ha Noi, Viet Nam"],"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, Ha Noi University of Science Technology, Ha Noi, Viet Nam","institution_ids":["https://openalex.org/I94518387"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5010194618"],"corresponding_institution_ids":["https://openalex.org/I94518387"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14931877,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"412","last_page":"418"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7369480133056641},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.7244127988815308},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.6515241861343384},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6044595837593079},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5661197304725647},{"id":"https://openalex.org/keywords/landmark","display_name":"Landmark","score":0.5116932392120361},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46255603432655334},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4270963668823242},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22205352783203125},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16384369134902954},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1114378273487091}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7369480133056641},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.7244127988815308},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.6515241861343384},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6044595837593079},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5661197304725647},{"id":"https://openalex.org/C2780297707","wikidata":"https://www.wikidata.org/wiki/Q4895393","display_name":"Landmark","level":2,"score":0.5116932392120361},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46255603432655334},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4270963668823242},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22205352783203125},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16384369134902954},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1114378273487091},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3368926.3369722","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3368926.3369722","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Tenth International Symposium on Information and Communication Technology  - SoICT 2019","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":22,"referenced_works":["https://openalex.org/W1559814459","https://openalex.org/W1585455900","https://openalex.org/W1910515323","https://openalex.org/W1967005434","https://openalex.org/W1989256614","https://openalex.org/W1989894105","https://openalex.org/W1990317614","https://openalex.org/W2000879295","https://openalex.org/W2032950184","https://openalex.org/W2057994027","https://openalex.org/W2095117703","https://openalex.org/W2152377721","https://openalex.org/W2152545366","https://openalex.org/W2154604089","https://openalex.org/W2161455936","https://openalex.org/W2162394398","https://openalex.org/W2233493213","https://openalex.org/W2290805605","https://openalex.org/W2433144350","https://openalex.org/W2564392169","https://openalex.org/W4233765214","https://openalex.org/W4236269389"],"related_works":["https://openalex.org/W2056853153","https://openalex.org/W2057559274","https://openalex.org/W2005087563","https://openalex.org/W2378111931","https://openalex.org/W2052388267","https://openalex.org/W2950647290","https://openalex.org/W3139829055","https://openalex.org/W2583811263","https://openalex.org/W3012931947","https://openalex.org/W2035944803"],"abstract_inverted_index":{"We":[0,55,122],"study":[1],"the":[2,16,20,29,37,52,103,130],"problem":[3],"of":[4,19,83,86],"graph":[5,30,33,120],"partitioning":[6],"balanced":[7],"on":[8,117],"weight":[9,18],"vertex":[10],"where":[11,36,69,147],"we":[12,148],"aim":[13],"to":[14,27,73,93],"maximize":[15],"average":[17],"obtained":[21],"subgraphs.":[22],"Our":[23],"proposed":[24,119,142],"approach":[25],"is":[26,80,91,106],"partition":[28,154],"by":[31,108],"a":[32,58,98,110,134,152],"Voronoi":[34,38],"diagram":[35],"nodes,":[39],"considered":[40],"as":[41],"landmarks,":[42],"are":[43],"carefully":[44],"selected":[45],"in":[46,97,102,128,132],"some":[47],"special":[48],"manner":[49],"for":[50,61,155],"achieving":[51],"mentioned":[53,135],"targets.":[54],"also":[56],"introduce":[57,123],"direct":[59],"application":[60],"this":[62],"problem,":[63],"namely":[64],"navigating":[65],"with":[66,140],"limited":[67,87],"resources,":[68],"one":[70],"would":[71],"like":[72],"produce":[74],"an":[75],"inexpensive":[76],"navigation":[77],"device":[78],"that":[79],"although":[81],"short":[82],"battery":[84],"and":[85],"memory":[88],"but":[89],"still":[90],"capable":[92],"help":[94],"showing":[95],"directions":[96],"long":[99],"hiking":[100],"journey":[101],"wilderness.":[104],"This":[105],"achieved":[107],"using":[109],"specialized":[111],"map":[112],"(for":[113],"navigating)":[114],"created":[115],"based":[116],"our":[118,141],"partitioning.":[121],"two":[124],"different":[125],"heuristic":[126],"techniques":[127],"selecting":[129],"landmarks":[131],"such":[133],"desired":[136],"manner.":[137],"Initial":[138],"experiments":[139],"algorithms":[143],"show":[144],"encouraging":[145],"results":[146],"can":[149],"successfully":[150],"construct":[151],"0.5-balanced":[153],"all":[156],"tested":[157],"graphs.":[158]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}