Zhongzheng Tang

Orcid: 0000-0002-8593-0383

According to our database1, Zhongzheng Tang authored at least 36 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Greedy+Singleton: An efficient approximation algorithm for <i>k</i>-submodular knapsack maximization.
Theor. Comput. Sci., February, 2024

2023
Data Placement and Transmission Scheduling for coded multicast in mobile edge networks.
Comput. Commun., July, 2023

A sharp upper bound for the transversal number of k-uniform connected hypergraphs with given size.
J. Comb. Optim., 2023

On the Matching Number of k-Uniform Connected Hypergraphs with Maximum Degree.
Proceedings of the Frontiers of Algorithmics - 17th International Joint Conference, 2023

An Improved Analysis of the Greedy+Singleton Algorithm for k-Submodular Knapsack Maximization.
Proceedings of the Frontiers of Algorithmics - 17th International Joint Conference, 2023

Improved Analysis of Greedy Algorithm on k-Submodular Knapsack.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Profit Maximization for Competitive Influence Spread in Social Networks.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

Greedy+Max: An Efficient Approximation Algorithm for k-Submodular Knapsack Maximization.
Proceedings of the Combinatorial Optimization and Applications, 2023

Some Combinatorial Algorithms on the Dominating Number of Anti-rank k Hypergraphs.
Proceedings of the Combinatorial Optimization and Applications, 2023

2022
SNIFF: A Scalable Network Inference Framework for Measuring End-to-End Performance.
IEEE Trans. Netw. Sci. Eng., 2022

Monotone <i>k</i>-submodular secretary problems: Cardinality and knapsack constraints.
Theor. Comput. Sci., 2022

On maximizing a monotone <i>k</i>-submodular function under a knapsack constraint.
Oper. Res. Lett., 2022

Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number.
J. Comb. Optim., 2022

Triangle packing and covering in dense random graphs.
J. Comb. Optim., 2022

SIC-based Precoding Scheme with Sub-connected Architecture for MIMO VLC Systems.
Proceedings of the IEEE Global Communications Conference, 2022

On the Transversal Number of Rank k Hypergraphs.
Proceedings of the Frontiers of Algorithmic Wisdom, 2022

Some New Results on Gallai Theorem and Perfect Matching for k-Uniform Hypergraphs.
Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

Monotone k-Submodular Knapsack Maximization: An Analysis of the Greedy+Singleton Algorithm.
Proceedings of the Algorithmic Aspects in Information and Management, 2022

On the Transversal Number of k-Uniform Connected Hypergraphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2022

2021
Algorithms for the metric ring star problem with fixed edge-cost ratio.
J. Comb. Optim., 2021

Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game.
Inf. Process. Lett., 2021

On maximizing a monotone k-submodular function under a knapsack constraint.
CoRR, 2021

On the Feedback Number of 3-Uniform Linear Extremal Hypergraphs.
Proceedings of the Combinatorial Optimization and Applications, 2021

2020
Mechanism Design for Facility Location Games with Candidate Locations.
Proceedings of the Combinatorial Optimization and Applications, 2020

Price of Fairness in Budget Division for Egalitarian Social Welfare.
Proceedings of the Combinatorial Optimization and Applications, 2020

Packing and Covering Triangles in Dense Random Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2020

Approximation Algorithms for Balancing Signed Graphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019
Coded multicasting in cache-enabled vehicular ad hoc network.
Comput. Networks, 2019

Noise-Resilient Similarity Preserving Network Embedding for Social Networks.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

SNIFF: A Scalable Network Inference Framework for Measuring End-to-End Performance Based on Matrix Completion.
Proceedings of the 5th International Conference on Big Data Computing and Communications, 2019

2018
Covering Triangles in Edge-Weighted Graphs.
Theory Comput. Syst., 2018

Approximation algorithms on k-cycle covering and k-clique covering.
CoRR, 2018

Mechanism Design for Two-Opposite-Facility Location Games with Penalties on Distance.
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

2017
Algorithms for the Ring Star Problem.
Proceedings of the Combinatorial Optimization and Applications, 2017

2016
Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Total Dual Integrality of Triangle Covering.
Proceedings of the Combinatorial Optimization and Applications, 2016


  Loading...