Zhaohui Liu 0001

VLDB 2026 Research / reviewers in the wild / expert

dblp:05/5317-1 · DBLP profile ↗

← Back

38ranked-venue papers

4as first author

15since 2021 · last 2026

0000-0003-1215-7622ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 33 · 4 first-author · 12 since 2021Databases, data management, data science and information retrieval · 7 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 4 · 3 since 2021Computer networks · 1

Year	Publication	Venue	Position
2026	Improved Algorithms for the Maximum Weight Star Packing Problem Zhaohui Liu 0001, Wei Yu 0011, An Zhang	COCOON	3
2026	Approximation algorithms for the capacitated min-max and minimum graph cover problems Jiafeng Xiong, Zhaohui Liu 0001, Wei Yu 0011	Theor. Comput. Sci.	2
2025	An Improved Approximation Algorithm for the Minimum k-Star Partition Problem Wei Yu 0011, Zhaohui Liu 0001	COCOON (1)	3
2025	Approximating Graphic Min-Max and Minimum Cycle/Path/Tree Cover Problems Wei Yu 0011, Zhaohui Liu 0001	Discret. Appl. Math.	2
2024	Approximation Algorithms for the Minimum Weight Cycle/Path Partition Problem Wei Yu 0011, Zhaohui Liu 0001	AAIM (1)	3
2024	Approximation Algorithms for the Capacitated Min-Max and Minimum Graph Cover Problems Jiafeng Xiong, Zhaohui Liu 0001, Wei Yu 0011	COCOA (1)	2
2024	Approximating the Maximum Weight Cycle/Path Partition in Graphs with Weights One and Two Xinmeng Guo, Wei Yu 0011, Zhaohui Liu 0001	COCOON (1)	3
2024	Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover Problem and Its Variants Liting Huang, Wei Yu 0011, Zhaohui Liu 0001	Algorithmica	3
2024	Improved approximation algorithms for the k-path partition problem Wei Yu 0011, Zhaohui Liu 0001	J. Glob. Optim.	3
2023	Exact and Approximation Algorithms for the Multi-depot Data Mule Scheduling with Handling Time and Time Span Constraints Minqin Liu, Wei Yu 0011, Zhaohui Liu 0001, Xinmeng Guo	COCOA (1)	3
2022	Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover Problem and Its Variants Liting Huang, Wei Yu 0011, Zhaohui Liu 0001	COCOON	3
2022	Approximation algorithms for some Minimum Postmen Cover Problems Yuying Mao, Wei Yu 0011, Zhaohui Liu 0001, Jiafeng Xiong	Discret. Appl. Math.	3
2022	Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints Wei Yu 0011, Zhaohui Liu 0001	Inf. Process. Lett.	2
2022	An asymptotically tight online algorithm for m-Steiner Traveling Salesman Problem Yubai Zhang, Zhao Zhang 0002, Zhaohui Liu 0001, Qirong Chen	Inf. Process. Lett.	3
2021	Approximation Algorithms for Some Min-Max and Minimum Stacker Crane Cover Problems Yuhui Sun, Wei Yu 0011, Zhaohui Liu 0001	COCOA	3
2020	New LP relaxations for Minimum Cycle/Path/Tree Cover Problems Wei Yu 0011, Zhaohui Liu 0001, Xiaoguang Bao	Theor. Comput. Sci.	2
2019	Approximation Algorithms for Some Minimum Postmen Cover Problems Yuying Mao, Wei Yu 0011, Zhaohui Liu 0001, Jiafeng Xiong	COCOA	3
2019	Distance Constrained Vehicle Routing Problem to Minimize the Total Cost Wei Yu 0011, Zhaohui Liu 0001, Xiaoguang Bao	COCOON	2
2019	New approximation algorithms for the minimum cycle cover problem Wei Yu 0011, Zhaohui Liu 0001, Xiaoguang Bao	Theor. Comput. Sci.	2
2018	New LP Relaxations for Minimum Cycle/Path/Tree Cover Problems Wei Yu 0011, Zhaohui Liu 0001, Xiaoguang Bao	AAIM	2
2017	Better Inapproximability Bounds and Approximation Algorithms for Min-Max Tree/Cycle/Path Cover Problems Wei Yu 0011, Zhaohui Liu 0001	COCOON	2
2017	A note on approximation algorithms of the clustered traveling salesman problem Xiaoguang Bao, Zhaohui Liu 0001, Wei Yu 0011, Ganggang Li	Inf. Process. Lett.	2
2016	Semi-online scheduling with bounded job sizes on two uniform machines Zhaohui Liu 0001	Theor. Comput. Sci.	2
2016	Improved approximation algorithms for some min-max and minimum cycle cover problems Wei Yu 0011, Zhaohui Liu 0001	Theor. Comput. Sci.	2
2015	Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems Wei Yu 0011, Zhaohui Liu 0001	COCOON	2
2015	Online scheduling with equal processing times and machine eligibility constraints Zhaohui Liu 0001	Theor. Comput. Sci.	2
2013	Semi-online scheduling problems on two uniform machines under a grade of service provision Xinrong Lu, Zhaohui Liu 0001	Theor. Comput. Sci.	2
2012	An improved approximation algorithm for the clustered traveling salesman problem Xiaoguang Bao, Zhaohui Liu 0001	Inf. Process. Lett.	2
2012	Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle Xiaoguang Bao, Zhaohui Liu 0001	Theor. Comput. Sci.	2
2011	Single-vehicle scheduling problems with release and service times on a line abstract We consider the following vehicle scheduling problem. There are some customers on a line that will be served by a single vehicle. Each customer is associated with a release time and a service time. The objective is to schedule the vehicle to minimize the makespan. For the tour version, where the makespan means the time when the vehicle has served all customers and returned back to its initial location, we present a 3/2-approximation algorithm. For the path version, where the makespan is defined as the time by which the last customer has been served completely, we present a 5/3-approximation algorithm. © 2010 Wiley Periodicals, Inc. NETWORKS, Vol. 57(2), 128–134 2011 Wei Yu 0011, Zhaohui Liu 0001	Networks	2
2011	Semi-online scheduling with known partial information about job sizes on two identical machines Zhaohui Liu 0001, T. C. E. Cheng	Theor. Comput. Sci.	2
2010	Online scheduling with reassignment on two uniform machines Zhaohui Liu 0001	Theor. Comput. Sci.	2
2005	Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine Zhaohui Liu 0001, T. C. E. Cheng	Theor. Comput. Sci.	1
2004	The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan Jinjiang Yuan, Zhaohui Liu 0001, Chi To Ng 0001, T. C. E. Cheng	Theor. Comput. Sci.	2
2003	3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints T. C. E. Cheng, Zhaohui Liu 0001	Inf. Process. Lett.	2
2002	Scheduling with job release dates, delivery times and preemption penalties Zhaohui Liu 0001, T. C. E. Cheng	Inf. Process. Lett.	1
2000	Scheduling one batch processor subject to job release dates Zhaohui Liu 0001, Wenci Yu	Discret. Appl. Math.	1
1999	Scheduling Groups of Unit Length Jobs on Two Identical Parallel Machines Zhaohui Liu 0001, Wenci Yu, T. C. E. Cheng	Inf. Process. Lett.	1