Author Info
Name
Affiliation
Papers
LONGKUN GUO
School of Computer and Information Technology, Sun Yat-sen University, Guangzhou, China
16
Collaborators
Citations 
PageRank 
23
6
5.49
Referers 
Referees 
References 
19
290
121
Search Limit
100290
Title
Citations
PageRank
Year
Exact algorithms for finding constrained minimum spanning trees00.342022
Deterministic approximation algorithm for submodular maximization subject to a matroid constraint00.342021
LP-Based Algorithms for Computing Maximum Vertex-Disjoint Paths with Different Colors.00.342020
Approximation Guarantees for Deterministic Maximization of Submodular Function with a Matroid Constraint.00.342020
On the Complexity of and Algorithms for Min-Max Target Coverage On a Line Boundary.00.342019
Efficient Algorithms for Constrained Clustering with Side Information.00.342019
Participant selection for t-sweep k-coverage crowd sensing tasks20.382018
Efficient Data Retrieval Algorithms For Multiple Requests In Mimo Wireless Networks10.352017
Improved approximation algorithms for constrained fault-tolerant resource allocation20.362015
Improved Approximating Algorithms for Computing Energy Constrained Minimum Cost Steiner Trees.00.342015
Efficient Approximation Algorithms for the Largest Weight Data Retrieval Problem.00.342015
Efficient Approximation Algorithms for Computing \emph{k} Disjoint Restricted Shortest Paths.00.342015
Improved Approximation Algorithms for Constrained Fault-Tolerant Resource Allocation - (Extended Abstract).10.342013
Improved Approximations for Shallow-Light Spanning and Steiner Trees00.342012
Constrained Fault-Tolerant Resource Allocation00.342012
A Polynomial Algorithm for the Vertex Disjoint Min-Min Problem in Planar Graphs00.342011