Embedded Files
Professor
Department of Computer Science
College of Mathematics and Computer Science
Fuzhou University
Fuzhou, Fujian 350116, PR China
Qualifications and Career
2015-2016: Postdoc, School of Computer Science, The University of Adelaide
2011: Ph.D. in Computer Science, School of Computer Science and Technology, University of Science and Technology of China
2010.2~2011.1: Visiting PhD., School of Computer Science, The University of Adelaide, Australia
2005: Bachelor in Computer Science, School of Computer Science and Technology, University of Science and Technology of China
Representative Papers (* indicates corresponding authorship)
Longkun Guo*, Chaoqi Jia, Kewen Liao, Zhigang Lu, Minhui Xue, Near-optimal algorithms for instance-level constrained k-center clustering, IEEE Transactions on Neural Networks and Learning Systems (TNNLS), DOI: 10.1109/TNNLS.2025.3574268.
(Top Journal in Artificial Intelligence, CORE-A*)Weijie Fang, Yanggeng Fu, Jiaquan Gao, Longkun Guo*, Gregory Gutin, Xiaoyan Zhang: Acceleration of Timing-Aware Gate-Level Logic Simulation Through One-Pass GPU Parallelism. IEEE Transactions on Computers, DOI: 10.1109/TC.2025.3569135
(Top Journal in Computer Science, CCF A)Yue Sun, Donglei Du, Longkun Guo*, Dachuan Xu: An Optimal Absolute Approximation Algorithm for Computing k Restricted Shortest Paths. COCOON (1) 2024: 16-28
( TCS CCF B conference, Best Paper award, 1/277)Longkun Guo, Chaoqi Jia, Kewen Liao, Zhigang Lu, Minhui Xue: Efficient Constrained k-Center Clustering with Background Knowledge, In Proceedings of the 38th AAAI Conference on Artificial Intelligence (AAAI-24), AAAI, Vancouver, Canada, pp. 20709-20717. PDF
(Top-2 Conference in Artificial Intelligence, CCF A)Jin Li, Qirong Zhang, Shuling Xu, Xinlong Chen, Longkun Guo, Yang-Geng Fu: Curriculum-Enhanced Residual Soft An-Isotropic Normalization for Over-smoothness in Deep GNNs. In Proceedings of the 38th AAAI Conference on Artificial Intelligence (AAAI-24), AAAI, Vancouver, Canada, pp. 13528-13536. PDF
(Top-2 Conference in Artificial Intelligence, CCF A)Weijie Fang; Longkun Guo*; Jiawei Lin; Silu Xiong; Huan He; Jiacen Xu; Jianli Chen: Obstacle-Aware Length-Matching Routing for Any-Direction Traces in Printed Circuit Board, In Proceedings of the 61st ACM/IEEE Design Automation Conference (DAC-24), Moscone West, San Francisco, USA.
(Top Conference in EDA, CCF A)Jianshan Zhang, Haibo Luo, Xing Chen*, Hong Shen, Longkun Guo*: Minimizing Response Delay in UAV-Assisted Mobile Edge Computing by Joint UAV Deployment and Computation Offloading. IEEE Trans. Cloud Comput. 12(4): 1372-1386 (2024)
Guowei Dai, Longkun Guo, Gregory Z. Gutin, Xiaoyan Zhang, Zan-Bo Zhang: Iterative Message Passing Algorithm for Vertex-disjoint Shortest Paths, IEEE Transactions on Information Theory, 68(6): 3870-3878 (2022)
(Alphabetical order, Top Journal in TCS, CCF A)Longkun Guo, Yunyun Deng, Kewen Liao, Qiang He, Timos Sellis, Zheshan Hu: A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths. IJCAI 2018: 1456-1462 PDF
(Top-2 Conference in Artificial Intelligence, CCF A)Longkun Guo, Hong Shen: Efficient Approximation Algorithms for the Bounded Flexible Scheduling Problem in Clouds. IEEE Trans. Parallel Distributed Syst. 28(12): 3511-3520 (2017) PDF
(Top Journal in Parallel and Distributed Computing, CCF A)
Longkun Guo, Hong Shen, Wenxing Zhu: Efficient Approximation Algorithms for Multi-Antennae Largest Weight Data Retrieval. IEEE Trans. Mob. Comput. 16(12): 3320-3333 (2017) PDF
(Top Conference in Mobile Computing, CCF A)
Longkun Guo, Wenjie Zou, Chenchen Wu, Dachuan Xu, Ding-Zhu Du: MinSum Movement of Barrier and Target Coverage using Sink-based Mobile Sensors on the Plane. ICDCS 2021: 696-706 PDF
(Top Conference in Distributed Computing, CCF B)Pei Yao (Supervised student), Longkun Guo*, Peng Li, Jiawei Lin: Optimal algorithm for min-max line barrier coverage with mobile sensors on 2-dimensional plane. Comput. Networks 228: 109717 (2023)
(JCR Q1, CCF B)
Grants
Natural Science Foundation of China (NSFC), 1st CI, “Combinatorial Optimization Algorithms and Theory for Emerging Resource Allocation Problems in Cloud-Edge Environment (12271098)”, RMB 460,000, 2023.01-2026.12.
Natural Science Foundation of China (NSFC), 1st CI, “Theory and Applications for disjoint QoS paths (61772005)”, RMB 550,000, 2018.01-2021.12.
Natural Science Foundation of China (NSFC), 1st CI, “Approximation algorithms for disjoint QoS paths and Steiner networks (61300025)”, RMB 230,000, 2014.01-2016.12.
Natural Science Foundation of Fujian Province, 1st CI, “LP-based Algorithms for disjoint QoS paths (2017J01753)”, RMB 90,000, 2017.04-2020.04.
Natural Science Foundation of Fujian Province, 1st CI, “Algorithms for efficient video streaming in clouds (2012J05115)”, RMB 40,000, 2012.01-2014.12.
Doctoral Funds of Ministry of Education of China for Young Scholars, 1st CI, “Robust video streaming via disjoint paths (20123514120013)”, RMB 40,000, 2012.01-2015.12.
Development Funds of Fuzhou University, 1st CI, “Reliable video streaming over disjoint paths”, RMB 35,000, 2012.01-2015.12.
Startup Funds for Young Scholars of Fuzhou University, CI, “Survivable network design via disjoint paths”, RMB 50,000, 2011.09-2014.12.
Natural Science Foundation of China (NSFC), 3rd CI, “主动学习式群感知任务分配方法研究 (61772136)”, RMB 630,000, 2018.01-2021.12.
Natural Science Foundation of China (NSFC), 2ed CI, “保护数据隐私性及抗量子密码分析的可搜索加密研究(61402112)”, RMB 260,000, 2015.01-2017.12.
Journal Papers (* indicates corresponding authorship):
2023
Pei Yao (Supervised student), Longkun Guo*, Peng Li, Jiawei Lin: Optimal algorithm for min-max line barrier coverage with mobile sensors on 2-dimensional plane. Comput. Networks 228: 109717 (2023)
Yang-Geng Fu, Geng-Chao Fang, Yong-Yu Liu, Longkun Guo*, Ying-Ming Wang: Disjunctive belief rule-based reasoning for decision making with incomplete information. Inf. Sci. 625: 49-64 (2023)
Wenjie Zou, Longkun Guo*, Chunlin Hao, Lei Liu: Approximation algorithm for MinSum linear barrier coverage with sink-based mobile sensors on the plane. Theor. Comput. Sci. 941: 121-130 (2023)
Longkun Guo, Kewen Liao, Di Xiao, Pei Yao: Submodular maximization over data streams with differential privacy noise. Theor. Comput. Sci. 944: 113625 (2023)
2022
Xuening Gao, Longkun Guo*, Kewen Liao: Efficient approximation algorithms for offline and online unit disk multiple coverage. Comput. Electr. Eng. 104(Part): 108444 (2022)
Kaizhi Chen, Chengpei Le, Shangping Zhong, Longkun Guo, Ge Xu: NNNPE: non-neighbourhood and neighbourhood preserving embedding. Connect. Sci. 34(1): 2615-2629 (2022)
Hengquan Mei, Longkun Guo*, Wenjie Zou, Peihuang Huang, Zhiyong Yu, Yongrui Qin: Min-max movement of barrier coverage with sink-based mobile sensors for crowdsensing. Pervasive Mob. Comput. 85: 101653 (2022)
Ruiqi Yang, Dachuan Xu, Longkun Guo, and Dongmei Zhang. Regularized two-stage submodular maximization under streaming. Sci. China Inf. Sci., 65(4), 2022.
Wenjie Zou, Longkun Guo*, Peihuang Huang, Geng Lin, and Hengquan Mei. Linear time algorithm for computing min-max movement of sink-based mobile sensors for line barrier coverage. Concurr. Comput. Pract. Exp., 34(2), 2022.
Min Cui, Dachuan Xu, Longkun Guo*, and Dan Wu. Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint. J. Comb. Optim., 43(5):1671–1690, 2022.
Sai Ji, Dachuan Xu, Longkun Guo*, Min Li, Dongmei Zhang: The seeding algorithm for spherical k-means clustering with penalties. J. Comb. Optim. 44(3): 1977-1994 (2022)
Pei Yao, Longkun Guo*: Exact algorithms for finding constrained minimum spanning trees. J. Comb. Optim. 44(3): 2085-2103 (2022)
Xiaoyun Tian, Dachuan Xu, Longkun Guo*, Dan Wu: Improved local search algorithms for Bregman k-means and its variants. J. Comb. Optim. 44(4): 2533-2550 (2022)
Zhicheng Liu, Longkun Guo*, Donglei Du, Dachuan Xu, and Xiaoyan Zhang. Maximization problems of balancing submodular relevance and supermodular diversity. J. Glob. Optim., 82(1):179–194, 2022.
Jianli Chen, Ziran Zhu, Longkun Guo, Yu-Wei Tseng, and Yao-Wen Chang. Mixed-cell-height placement with drain-to-drain abutment and region constraints. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 41(4):1103–1115, 2022.
Guowei Dai, Longkun Guo, Gregory Z. Gutin, Xiaoyan Zhang, and Zan- Bo Zhang. Iterative message passing algorithm for vertex-disjoint shortest paths. IEEE Trans. Inf. Theory, 68(6):3870–3878, 2022.
2021
Zhenning Zhang, Longkun Guo*, Yishui Wang, Dachuan Xu, and Dong-mei Zhang. Streaming algorithms for maximizing monotone dr-submodular functions with a cardinality constraint on the integer lattice. Asia Pac. J. Oper. Res., 38(5):2140004:1–2140004:14, 2021.
Ziran Zhu, Zhipeng Huang, Jianli Chen, and Longkun Guo*. Topology- aware bus routing in complex networks of very-large-scale integration with nonuniform track configurations and obstacles. Complex., 2021:8843271:1– 8843271:12, 2021.
Ruiqi Yang, Dachuan Xu, Longkun Guo*, and Dongmei Zhang. Sequence submodular maximization meets streaming. J. Comb. Optim., 41(1):43–55, 2021.
Longkun Guo and Peng Li. On the complexity of and algorithms for detecting k-length negative cost cycles. J. Comb. Optim., 42(3):396–408, 2021.
Hongxiang Zhang, Dachuan Xu, Longkun Guo*, and Jingjing Tan. Parallelized maximization of nonsubmodular function subject to a cardinality constraint. Theor. Comput. Sci., 864:129–137, 2021.
Yunyun Deng, Longkun Guo*, Kewen Liao, and Yi Chen. On finding maximum disjoint paths with different colors: Computational complexity and practical lp-based algorithms. Theor. Comput. Sci., 886:157–168, 2021.
Xin Sun, Dachuan Xu, Longkun Guo*, and Min Li. Deterministic approximation algorithm for submodular maximization subject to a matroid con- straint. Theor. Comput. Sci., 890:1–15, 2021.
2020
Zijing Ma, Shuangjuan Li, Longkun Guo*, and Guohua Wang. Energy-efficient non-linear k-barrier coverage in mobile sensor network. Comput. Sci. Inf. Syst., 17(3):737–758, 2020.
Xing Chen, Haijiang Wang, Yun Ma, Xianghan Zheng, and Longkun Guo*. Self-adaptive resource allocation for cloud-based software services based on iterative qos prediction model. Future Gener. Comput. Syst., 105:287–296, 2020.
Zhiyong Yu, Weiping Zhu, Longkun Guo*, Wenzhong Guo, and Zhiwen Yu. Task allocation for crowdsensing based on submodular optimisation. Int.
J. Ad Hoc Ubiquitous Comput., 33(1):48–61, 2020.
Yang-Geng Fu, Jin-Hui Zhuang, Yu-Peng Chen, Longkun Guo*, and Ying- Ming Wang. A framework for optimizing extended belief rule base systems with improved ball trees. Knowl. Based Syst., 210:106484, 2020.
2019
Shuangjuan Li, Hong Shen, Qiong Huang, and Longkun Guo*. Optimizing the sensor movement for barrier coverage in a sink-based deployed mobile sensor network. IEEE Access, 7:156301–156314, 2019.
Peihuang Huang, Wenxing Zhu, and Longkun Guo*. Optimizing movement for maximizing lifetime of mobile sensors for covering targets on a line. Sensors, 19(2):273, 2019.
Longkun Guo, Min Li, and Dachuan Xu. Efficient approximation algorithms for maximum coverage with group budget constraints. Theor. Com- put. Sci., 788:53–65, 2019.
2018 and Before
Peihuang Huang, Wenxing Zhu, Kewen Liao, Timos Sellis, Zhiyong Yu, and Longkun Guo*. Efficient algorithms for flexible sweep coverage in crowdsensing. IEEE Access, 6:50055–50065, 2018.
Zhiyong Yu, Jie Zhou, Wenzhong Guo, Longkun Guo, and Zhiwen Yu. Participant selection for t-sweep k-coverage crowd sensing tasks. World Wide Web, 21(3):741–758, 2018.
Ping He, Hong Shen, Longkun Guo, and Yidong Li. Efficient data retrieval algorithms for multiple requests in MIMO wireless networks. Int. J. Commun. Syst., 30(1), 2017.
Longkun Guo, Hong Shen, and Wenxing Zhu. Efficient approximation algorithms for multi-antennae largest weight data retrieval. IEEE Trans. Mob. Comput., 16(12):3320–3333, 2017.
Longkun Guo and Hong Shen. Efficient approximation algorithms for the bounded flexible scheduling problem in clouds. IEEE Trans. Parallel Distributed Syst., 28(12):3511–3520, 2017.
Longkun Guo. Efficient approximation algorithms for computing k disjoint constrained shortest paths. J. Comb. Optim., 32(1):144–158, 2016.
Kaizhi Chen, Chenjun Lin, Shangping Zhong, and Longkun Guo*. A parallel SRM feature extraction algorithm for steganalysis based on GPU architecture. Comput. Sci. Inf. Syst., 12(4):1345–1359, 2015.
Longkun Guo*, Hong Shen, and Kewen Liao. Improved approximation algorithms for computing k disjoint paths subject to two constraints. J. Comb. Optim., 29(1):153–164, 2015.
Kewen Liao, Hong Shen, and Longkun Guo*. Improved approximation algorithms for constrained fault-tolerant resource allocation. Theor. Comput. Sci., 590:118–128, 2015.
Longkun Guo and Hong Shen. On finding min-min disjoint paths. Algorithmica, 66(3):641–653, 2013.
Hong Shen and Longkun Guo. An eight-approximation algorithm for computing rooted three-vertex connected minimum Steiner networks. IEEE Trans. Computers, 62(9):1684–1693, 2013.
Hong Shen and Longkun Guo. Efficient 2-approximation algorithms for computing 2-connected Steiner minimal networks. IEEE Trans. Computers, 61(7):954–968, 2012.
Longkun Guo and Hong Shen. On the complexity of the edge-disjoint min- min problem in planar digraphs. Theor. Comput. Sci., 432:58–63, 2012.
Conference Papers:
[1] Xuening Gao, Longkun Guo, and Kewen Liao. Fast approximation algorithms for multiple coverage with unit disks. In WoWMoM, pages 185–193. IEEE, 2022.
[2] Wenjie Zou, Longkun Guo, Chunlin Hao, and Lei Liu. A fast FPTAS for two dimensional barrier coverage using sink-based mobile sensors with minsum movement. In AAIM, volume 13153 of Lecture Notes in Computer Science, pages 265–276. Springer, 2021.
[3] Binwei Lin, Zhiyong Yu, Fangwan Huang, and Longkun Guo. Pool-based sequential active learning for regression based on incremental cluster center selection. In CBD, pages 176–182. IEEE, 2021.
[4] Pei Yao, Longkun Guo, Shuangjuan Li, and Huihong Peng. Target coverage with minimum number of camera sensors. In COCOA, volume 13135 of Lecture Notes in Computer Science, pages 12–24. Springer, 2021.
[5] Xuanming Xu and Longkun Guo. Efficient algorithms for scheduling parallel jobs with interval constraints in clouds. In COCOA, volume 13135 of Lecture Notes in Computer Science, pages 195–202. Springer, 2021.
[6] Di Xiao, Longkun Guo, Kewen Liao, and Pei Yao. Streaming submodular maximization under differential privacy noise. In COCOA, volume 13135 of Lecture Notes in Computer Science, pages 431–444. Springer, 2021.
[7] Bingshu Wang, Lanfan Jiang, Wenxing Zhu, Longkun Guo, Jianli Chen, and Yao-Wen Chang. Two-stage neural network classifier for the data imbalance problem with application to hotspot detection. In DAC, pages 175–180. IEEE, 2021.
[8] Longkun Guo, Wenjie Zou, Chenchen Wu, Dachuan Xu, and Ding-Zhu Du. Minsum movement of barrier and target coverage using sink-based mobile sensors on the plane. In ICDCS, pages 696–706. IEEE, 2021.
[9] Huihong Peng, Longkun Guo, Long Sun, and Xiaoyan Zhang. Demo: Resource allocation for wafer-scale deep learning accelerator. In ICDCS, pages 1114–1115. IEEE, 2021.
[10] Pei Yao, Longkun Guo, and Jiguo Yu. Poster: Quadratic-time algorithms for optimal min-max barrier coverage with mobile sensors on the plane. In ICDCS, pages 1132–1133. IEEE, 2021.
[11] Pei Yao, Longkun Guo, Peng Li, and Jiawei Lin. Improved fast algorithms for optimal min-max line barrier coverage with mobile sensors on the plane. In MSWiM, pages 159–166. ACM, 2021.
[12] Min Cui, Dachuan Xu, Longkun Guo, and Dan Wu. Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint. In AAIM, volume 12290 of Lecture Notes in Computer Science, pages 195–203. Springer, 2020.
[13] Hongxiang Zhang, Dachuan Xu, Longkun Guo, and Jingjing Tan. Parallelized maximization of nonsubmodular function subject to a cardinality constraint. In COCOON, volume 12273 of Lecture Notes in Computer Science, pages 520–531. Springer, 2020.
[14] Xiaoyun Tian, Dachuan Xu, Longkun Guo, and Dan Wu. An improved bregman k-means++ algorithm via local search. In COCOON, volume 12273 of Lecture Notes in Computer Science, pages 532–541. Springer, 2020.
[15] Yuting Zhong and Longkun Guo. Group influence maximization in social networks. In CSoNet, volume 12575 of Lecture Notes in Computer Science, pages 152–163. Springer, 2020.
[16] Kaizhi Chen, Wencheng Wei, Shangping Zhong, and Longkun Guo. Bloodleukocyte object detection according to model parameter-transfer and deformable convolution. In PDCAT, volume 12606 of Lecture Notes in Computer Science, pages 1–16. Springer, 2020.
[17] Long Sun, Longkun Guo, and Peihuang Huang. System-level FPGA routing for logic verification with time-division multiplexing. In PDCAT, volume 12606 of Lecture Notes in Computer Science, pages 210–218. Springer, 2020.
[18] Longkun Guo, Bin Xing, Peihuang Huang, and Xiaoyan Zhang. Approximation algorithms for the general cluster routing problem. In PDCAT, volume 12606 of Lecture Notes in Computer Science, pages 264–273. Springer, 2020.
[19] Yuting Zhong, Longkun Guo, and Peihuang Huang. Maximizing group coverage in social networks. In PDCAT, volume 12606 of Lecture Notes in Computer Science, pages 274–284. Springer, 2020.
[20] Zhenning Zhang, Longkun Guo, Linyang Wang, and Juan Zou. A streaming model for monotone lattice submodular maximization with a cardinality constraint. In PDCAT, volume 12606 of Lecture Notes in Computer Science, pages 362–370. Springer, 2020.
[21] Yunyun Deng, Yi Chen, Kewen Liao, and Longkun Guo. Lp-based algorithms for computing maximum vertex-disjoint paths with different colors. In TAMC, volume 12337 of Lecture Notes in Computer Science, pages 107–118. Springer, 2020.
[22] Ruiqi Yang, Dachuan Xu, Longkun Guo, and Dongmei Zhang. Parametric streaming two-stage submodular maximization. In TAMC, volume 12337 of Lecture Notes in Computer Science, pages 193–204. Springer, 2020.
[23] Xin Sun, Dachuan Xu, Longkun Guo, and Min Li. Approximation guarantees for deterministic maximization of submodular function with a matroid constraint. In TAMC, volume 12337 of Lecture Notes in Computer Science, pages 205–214. Springer, 2020.
[24] Sai Ji, Dachuan Xu, Longkun Guo, Min Li, and Dongmei Zhang. The seeding algorithm for spherical k-means clustering with penalties. In AAIM, volume 11640 of Lecture Notes in Computer Science, pages 149–158. Springer, 2019.
[25] Yi Chen, Peihuang Huang, and Longkun Guo. Evaluating connection quality between two individuals in social networks. In BESC, pages 1–6. IEEE,2019.
[26] Hongyu Sun, Qiang He, Kewen Liao, Timos Sellis, Longkun Guo, Xuyun Zhang, Jun Shen, and Feifei Chen. Fast anomaly detection in multiple multi-dimensional data streams. In IEEE BigData, pages 1218–1223. IEEE, 2019.
[27] Ruiqi Yang, Dachuan Xu, Longkun Guo, and Dongmei Zhang. Sequence submodular maximization meets streaming. In COCOA, volume 11949 of Lecture Notes in Computer Science, pages 565–575. Springer, 2019.
[28] Longkun Guo, Chenchen Wu, Huahui Yu, and Xiaoyan Zhang. Strategy-proof cost-sharing mechanism design for a generalized cover-sets problem
(extended abstract). In CSoNet, volume 11917 of Lecture Notes in Computer Science, pages 77–78. Springer, 2019.
[29] Haijiang Wang, Yun Ma, Xianghan Zheng, Xing Chen, and Longkun Guo. Self-adaptive resource management framework for software services in cloud. In ISPA/BDCloud/SocialCom/SustainCom, pages 1528–1529. IEEE, 2019.
[30] Zijing Ma, Shuangjuan Li, Longkun Guo, and Guohua Wang. Non-linear k-barrier coverage in mobile sensor network. In PAAP, volume 1163 of Communications in Computer and Information Science, pages 12–23. Springer, 2019.
[31] Zhendong Hao, Longkun Guo, Pei Yao, Peihuang Huang, and Huihong Peng. Efficient algorithms for constrained clustering with side information. In PAAP, volume 1163 of Communications in Computer and Information Science, pages 275–286. Springer, 2019.
[32] Wenjie Zou, Longkun Guo, and Peihuang Huang. Min-max movement of sink-based mobile sensors in the plane for barrier coverage. In PDCAT, pages 1–6. IEEE, 2019.
[33] Peihuang Huang, Wenxing Zhu, and Longkun Guo. On the complexity of and algorithms for min-max target coverage on a line boundary. In TAMC, volume 11436 of Lecture Notes in Computer Science, pages 313–324. Springer, 2019.
[34] Yunyun Deng, Longkun Guo, and Peihuang Huang. Exact algorithms for finding partial edge-disjoint paths. In COCOON, volume 10976 of Lecture Notes in Computer Science, pages 14–25. Springer, 2018.
[35] Yihong Zhang, Yongrui Qin, and Longkun Guo. Constructing multiple domain taxonomy for text processing tasks. In DEXA (2), volume 11030 of Lecture Notes in Computer Science, pages 501–509. Springer, 2018.
[36] Longkun Guo, Yunyun Deng, Kewen Liao, Qiang He, Timos Sellis, and Zheshan Hu. A fast algorithm for optimally finding partially disjoint shortest paths. In IJCAI 2018, pages 1456–1462.
[37] Pei Yao and Longkun Guo. Fast approximation algorithms for computing constrained minimum spanning trees. In COCOA (1), volume 10627 of Lecture Notes in Computer Science, pages 103–110. Springer, 2017.
[38] Longkun Guo and Peng Li. On the complexity of detecting k-length negative cost cycles. In COCOA (1), volume 10627 of Lecture Notes in Computer Science, pages 240–250. Springer, 2017.
[39] Longkun Guo, Min Li, and Dachuan Xu. Approximation algorithms for maximum coverage with group budget constraints. In COCOA (2), volume 10628 of Lecture Notes in Computer Science, pages 362–376. Springer, 2017.
[40] Longkun Guo and Hong Shen. Privacy-preserving internet traffic publication. In Trustcom/BigDataSE/ISPA, pages 884–891. IEEE, 2016.
[41] Nianchen Zou and Longkun Guo. Improved approximating algorithms for computing energy constrained minimum cost steiner trees. In ICA3PP (1), volume 9528 of Lecture Notes in Computer Science, pages 567–577. Springer, 2015.
[42] Longkun Guo, Kewen Liao, Hong Shen, and Peng Li. Brief announcement: Efficient approximation algorithms for computing k disjoint restricted shortest paths. In SPAA, pages 62–64. ACM, 2015.
[43] Longkun Guo. Improved lp-rounding approximations for the k-disjoint restricted shortest paths problem. In FAW, volume 8497 of Lecture Notes in Computer Science, pages 94–104. Springer, 2014.
[44] Longkun Guo, Nianchen Zou, and Yidong Li. Approximating the shallow-light steiner tree problem when cost and delay are linearly dependent. In PAAP, pages 99–103. IEEE Computer Society, 2014.
[45] Kaizhi Chen, Chenjun Lin, Shangping Zhong, and Longkun Guo. A parallelSRM feature extraction algorithm for steganalysis based on GPU architecture. In PAAP, pages 178–182. IEEE Computer Society, 2014.
[46] Longkun Guo, Kewen Liao, and Hong Shen. On the shallow-light steiner tree problem. In PDCAT, pages 56–60. IEEE Computer Society, 2014.
[47] Longkun Guo, Hong Shen, and Kewen Liao. Improved approximation algorithms for computing k disjoint paths subject to two constraints. In COCOON, volume 7936 of Lecture Notes in Computer Science, pages 325–336. Springer, 2013.
[48] Kewen Liao, Hong Shen, and Longkun Guo. Improved approximation algorithms for constrained fault-tolerant resource allocation - (extended abstract). In FCT, volume 8070 of Lecture Notes in Computer Science, pages 236–247. Springer, 2013.
[49] Longkun Guo and Hong Shen. Efficient approximation algorithms for computing k-disjoint minimum cost paths with delay constraint. In PDCAT, pages 627–631. IEEE, 2012.
[50] Longkun Guo and Hong Shen. Hardness of finding two edge-disjoint min-min paths in digraphs. In FAW-AAIM, volume 6681 of Lecture Notes in Computer Science, pages 300–307. Springer, 2011.
[51] Longkun Guo and Hong Shen. A polynomial algorithm for the vertex disjoint min-min problem in planar graphs. In PAAP, pages 47–51. IEEE Computer Society, 2011.
Page updated
Google Sites
Report abuse