{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:28:39Z","timestamp":1750220919151,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":21,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1145\/3368926.3369722","type":"proceedings-article","created":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T13:30:11Z","timestamp":1576848611000},"page":"412-418","source":"Crossref","is-referenced-by-count":0,"title":["Balanced landmark-based graph partitioning with application in navigating with limited resources"],"prefix":"10.1145","author":[{"given":"Chi-Hieu","family":"Nguyen","sequence":"first","affiliation":[{"name":"School of Information and Communication Technology, Ha Noi University of Science Technology, Ha Noi, Viet Nam"}]},{"given":"Khanh-Van","family":"Nguyen","sequence":"additional","affiliation":[{"name":"School of Information and Communication Technology, Ha Noi University of Science Technology, Ha Noi, Viet Nam"}]}],"member":"320","reference":[{"doi-asserted-by":"crossref","unstructured":"Franz Aurenhammer. 1991. Voronoi Diagrams---a Survey of a Fundamental Geometric Data Structure. ACM Comput. Surv. 23, 3 (Sept. 1991), 345--405. https:\/\/doi.org\/10.1145\/116873.116880","key":"key-10.1145\/3368926.3369722-1","DOI":"10.1145\/116873.116880"},{"doi-asserted-by":"crossref","unstructured":"Punam Bedi and Chhavi Sharma. 2016. Community detection in social networks. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery 6 (02 2016), n\/a-n\/a. https:\/\/doi.org\/10.1002\/widm.1178","key":"key-10.1145\/3368926.3369722-2","DOI":"10.1002\/widm.1178"},{"doi-asserted-by":"crossref","unstructured":"Víctor Bucarey, Fernando Ordonez, and Enrique Bassaletti. 2015. Shape and Balance in Police Districting. 329--347. https:\/\/doi.org\/10.1007\/978-3-319-20282-2_14","key":"key-10.1145\/3368926.3369722-3","DOI":"10.1007\/978-3-319-20282-2_14"},{"doi-asserted-by":"crossref","unstructured":"Aydin Buluç, Henning Meyerhenke, Ilya Safro, Peter Sanders, and Christian Schulz. 2016. Recent Advances in Graph Partitioning. Vol. 9220. https:\/\/doi.org\/10.1007\/978-3-319-49487-6_4","key":"key-10.1145\/3368926.3369722-4","DOI":"10.1007\/978-3-319-49487-6_4"},{"unstructured":"Martin Erwig. 2000. The graph Voronoi diagram with applications. Networks 36 (10 2000), 156--163. https:\/\/doi.org\/10.1002\/1097-0037(200010)36:3< 156::AID-NET2>3.0.CO;2-L","key":"key-10.1145\/3368926.3369722-5"},{"doi-asserted-by":"crossref","unstructured":"C.M. Fiduccia and R. M. Mattheyses. 1982. A Linear-Time Heuristic for Improving Network Partitions. In 19th Design Automation Conference. 175--181. https:\/\/doi.org\/10.1109\/DAC.1982.1585498","key":"key-10.1145\/3368926.3369722-6","DOI":"10.1109\/DAC.1982.1585498"},{"doi-asserted-by":"crossref","unstructured":"M. R. Garey, D. S.Johnson, and L. Stockmeyer. 1974. Some Simplified NP-complete Problems. In Proceedings of the Sixth Annual ACM Symposium on Theory of Computing (STOC '74). ACM, New York, NY, USA, 47--63. https:\/\/doi.org\/10.1145\/800119.803884","key":"key-10.1145\/3368926.3369722-7","DOI":"10.1145\/800119.803884"},{"doi-asserted-by":"crossref","unstructured":"S. Honiden, M. E. Houle, and C. Sommer. 2009. Balancing Graph Voronoi Diagrams. In 2009 Sixth International Symposium on Voronoi Diagrams. 183--191.https:\/\/doi.org\/10.1109\/ISVD.2009.26","key":"key-10.1145\/3368926.3369722-8","DOI":"10.1109\/ISVD.2009.26"},{"doi-asserted-by":"crossref","unstructured":"Takehiro Ito, Xiao Zhou, and Takao Nishizeki. 2004. Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size. In Proceedings of the 30th International Conference on Graph-Theoretic Concepts in Computer Science (WG'04). Springer-Verlag, Berlin, Heidelberg, 365--376. https:\/\/doi.org\/10.1007\/978-3-540-30559-0_31","key":"key-10.1145\/3368926.3369722-9","DOI":"10.1007\/978-3-540-30559-0_31"},{"doi-asserted-by":"crossref","unstructured":"Lin-Ming Jin and Shu-Park Chan. 1992. A genetic approach for network partitioning. International Journal of Computer Mathematics 42, 1-2 (1992), 47--60. https:\/\/doi.org\/10.1080\/00207169208804049 arXiv:https:\/\/doi.org\/10.1080\/00207169208804049","key":"key-10.1145\/3368926.3369722-10","DOI":"10.1080\/00207169208804049"},{"doi-asserted-by":"crossref","unstructured":"Jörg Kalcsics. 2015. Districting Problems. 595--622. https:\/\/doi.org\/10.1007\/978-3-319-13111-5_23","key":"key-10.1145\/3368926.3369722-11","DOI":"10.1007\/978-3-319-13111-5_23"},{"doi-asserted-by":"crossref","unstructured":"Jörg Kalcsics, Stefan Nickel, and Michael Schröder. 2005. Towards a unified territorial design approach --- Applications, algorithms and GIS integration. TOP: An Official Journal of the Spanish Society of Statistics and Operations Research 13 (02 2005), 1--56. https:\/\/doi.org\/10.1007\/BF02578982","key":"key-10.1145\/3368926.3369722-12","DOI":"10.1007\/BF02578982"},{"doi-asserted-by":"crossref","unstructured":"B. W. Kernighan and S. Lin. 1970. An Efficient Heuristic Procedure for Partitioning Graphs. Bell System Technical Journal 49, 2 (1970), 291--307. https:\/\/doi.org\/10.1002\/j.1538-7305.1970.tb01770.x arXiv:https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/j.1538-7305.1970.tb01770.x","key":"key-10.1145\/3368926.3369722-13","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"unstructured":"Nashat Mansour. 1992. Physical Optimization Algorithms for Mapping Data to Distributed-memory Multiprocessors. Ph.D. Dissertation. Syracuse, NY, USA. UMI Order No. GAX93-08932.","key":"key-10.1145\/3368926.3369722-14"},{"doi-asserted-by":"crossref","unstructured":"Kurt Mehlhorn. 1988. A faster approximation algorithm for the Steiner problem in graphs. Inform. Process. Lett. 27, 3 (1988), 125 -- 128. https:\/\/doi.org\/10.1016\/0020-0190(88)90066-X","key":"key-10.1145\/3368926.3369722-15","DOI":"10.1016\/0020-0190(88)90066-X"},{"doi-asserted-by":"crossref","unstructured":"Rolf Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, and Thomas Willhalm. 2005. Partitioning Graphs to Speed Up Dijkstra's Algorithm. Lecture Notes in Computer Science 3503, 189--202. https:\/\/doi.org\/10.1007\/11427186_18","key":"key-10.1145\/3368926.3369722-16","DOI":"10.1007\/11427186_18"},{"doi-asserted-by":"crossref","unstructured":"Gary L. Miller, Shang-Hua Teng, and Stephen A. Vavasis. 1991. A Unified Geometric Approach to Graph Separators. In Proceedings of the 32Nd Annual Symposium on Foundations of Computer Science (SFCS '91). IEEE Computer Society, Washington, DC, USA, 538--547. https:\/\/doi.org\/10.1109\/SFCS.1991.185417","key":"key-10.1145\/3368926.3369722-17","DOI":"10.1109\/SFCS.1991.185417"},{"doi-asserted-by":"crossref","unstructured":"Hassan Sayyadi and Louiqa Raschid. 2013. A Graph Analytical Approach for Topic Detection. ACM Trans. Internet Technol. 13, 2, Article 4 (Dec. 2013), 23 pages. https:\/\/doi.org\/10.1145\/2542214.2542215","key":"key-10.1145\/3368926.3369722-18","DOI":"10.1145\/2542214.2542215"},{"doi-asserted-by":"crossref","unstructured":"Frank Schulz, Dorothea Wagner, and Christos Zaroliagis. 2002. Using Multi-level Graphs for Timetable Information in Railway Systems. Workshop on Algorithm Engineering and Experiments (ALENEX), 43--59. https:\/\/doi.org\/10.1007\/3-540-45643-0_4","key":"key-10.1145\/3368926.3369722-19","DOI":"10.1007\/3-540-45643-0_4"},{"doi-asserted-by":"crossref","unstructured":"Mikkel Thorup, Mikkel Thorup, and Uri Zwick. 2001. Compact Routing Schemes. In Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '01). ACM, New York, NY, USA, 1--10. https:\/\/doi.org\/10.1145\/378580.378581","key":"key-10.1145\/3368926.3369722-20","DOI":"10.1145\/378580.378581"},{"doi-asserted-by":"crossref","unstructured":"Cuijuan Wang, Wenzhong Tang, Bo Sun, Jing Fang, and Yanyang Wang. 2015. Review on community detection algorithms in social networks. 551--555. https:\/\/doi.org\/10.1109\/PIC.2015.7489908","key":"key-10.1145\/3368926.3369722-21","DOI":"10.1109\/PIC.2015.7489908"}],"event":{"number":"10","sponsor":["SOICT, School of Information and Communication Technology - HUST","NAFOSTED, The National Foundation for Science and Technology Development"],"acronym":"SoICT 2019","name":"the Tenth International Symposium","start":{"date-parts":[[2019,12,4]]},"location":"Hanoi, Ha Long Bay, Viet Nam","end":{"date-parts":[[2019,12,6]]}},"container-title":["Proceedings of the Tenth International Symposium on Information and Communication Technology  - SoICT 2019"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3368926.3369722","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3369722&ftid=2101307&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:05Z","timestamp":1750204385000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3368926.3369722"}},"subtitle":[],"proceedings-subject":"Information and Communication Technology","short-title":[],"issued":{"date-parts":[[2019]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1145\/3368926.3369722","relation":{},"subject":[],"published":{"date-parts":[[2019]]}}}