Zhen Zhang

Orcid: 0000-0002-2974-5781

Affiliations:
  • Hunan University of Technology and Business, China
  • Central South University, School of Computer Science and Engineering, Hunan Provincial Key Lab on Bioinformatics, Changsha, China


According to our database1, Zhen Zhang authored at least 23 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Align-IQA: Aligning Image Quality Assessment Models with Diverse Human Preferences via Customizable Guidance.
Proceedings of the 32nd ACM International Conference on Multimedia, MM 2024, Melbourne, VIC, Australia, 28 October 2024, 2024

Faster Approximation Schemes for (Constrained) k-Means with Outliers.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Towards a Theoretical Understanding of Why Local Search Works for Clustering with Fair-Center Representation.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Fixed-parameter tractability of capacitated k-facility location.
Frontiers Comput. Sci., December, 2023

Improved approximation algorithms for solving the squared metric <i>k</i>-facility location problem.
Theor. Comput. Sci., 2023

On parameterized approximation algorithms for balanced clustering.
J. Comb. Optim., 2023

2022
Better guarantees for <i>k</i>-median with service installation costs.
Theor. Comput. Sci., 2022

Improved Fixed-Parameter Algorithm for the Tree Containment Problem on Unrooted Phylogenetic Network.
IEEE ACM Trans. Comput. Biol. Bioinform., 2022

An approximation algorithm for lower-bounded k-median with constant factor.
Sci. China Inf. Sci., 2022

Approximation Schemes for k-Facility Location.
Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021
Improved approximation for prize-collecting red-blue median.
Theor. Comput. Sci., 2021

Fixed-parameter tractability for the Tree Assembly problem.
Theor. Comput. Sci., 2021

A local search algorithm for <i>k</i>-means with outliers.
Neurocomputing, 2021

An approximation algorithm for k-median with priorities.
Sci. China Inf. Sci., 2021

A Parameterized Approximation Algorithm for the Chromatic k-Median Problem.
IEEE Access, 2021

Improved Parameterized Approximation for Balanced k-Median.
Proceedings of the Combinatorial Optimization and Applications, 2021

An Improved Approximation Algorithm for Squared Metric k-Facility Location.
Proceedings of the Combinatorial Optimization and Applications, 2021

2020
An Improved Approximation Algorithm for the Prize-Collecting Red-Blue Median Problem.
Proceedings of the Theory and Applications of Models of Computation, 2020

A Constant Factor Approximation for Lower-Bounded <i>k</i>-Median.
Proceedings of the Theory and Applications of Models of Computation, 2020

Tractabilities for Tree Assembly Problems.
Proceedings of the Theory and Applications of Models of Computation, 2020

A Unified Framework of FPT Approximation Algorithms for Clustering Problems.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2019
Improved Algorithms for Clustering with Outliers.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

An Improved Approximation Algorithm for the k-Means Problem with Penalties.
Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019


  Loading...