Zhongzheng Tang

Available identifiers

zbMath Open tang.zhongzhengMaRDI QIDQ726108

List of research outcomes

Publication	Date of Publication	Type
A sharp lower bound on the independence number of \(k\)-regular connected hypergraphs with rank \(R\)	2025-01-08	Paper
Some combinatorial algorithms on the edge cover number of \(k\)-regular connected hypergraphs	2024-11-12	Paper
\textsc{Greedy+Max}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization	2024-09-16	Paper
Some combinatorial algorithms on the dominating number of anti-rank \(k\) hypergraphs	2024-09-16	Paper
Profit maximization for competitive influence spread in social networks	2024-08-22	Paper
An improved analysis of the Greedy+Singleton algorithm for \(k\)-submodular knapsack maximization	2024-02-28	Paper
On the matching number of \(k\)-uniform connected hypergraphs with maximum degree	2024-02-28	Paper
Approximation algorithms on \(k\)-correlation clustering	2024-02-09	Paper
\textsc{Greedy+Singleton}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization	2024-01-02	Paper
Strategyproof facility location with limited locations	2023-09-12	Paper
Some new results on Gallai theorem and perfect matching for \(k\)-uniform hypergraphs	2023-08-10	Paper
On the transversal number of rank \(k\) hypergraphs	2023-08-03	Paper
On the transversal number of \(k\)-uniform connected hypergraphs	2023-07-07	Paper
Monotone \(k\)-submodular knapsack maximization: an analysis of the Greedy+Singleton algorithm	2023-07-07	Paper
Packing and covering triangles in dense random graphs	2023-03-21	Paper
Mechanism design for facility location games with candidate locations	2023-03-21	Paper
Price of fairness in budget division for egalitarian social welfare	2023-03-21	Paper
Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number	2022-10-31	Paper
Triangle packing and covering in dense random graphs	2022-10-18	Paper
On the feedback number of 3-uniform linear extremal hypergraphs	2022-06-29	Paper
Monotone \(k\)-submodular secretary problems: cardinality and knapsack constraints	2022-05-23	Paper
On maximizing a monotone \(k\)-submodular function under a knapsack constraint	2022-03-11	Paper
Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal	2021-12-13	Paper
Algorithms for the metric ring star problem with fixed edge-cost ratio	2021-11-25	Paper
Approximation algorithms for balancing signed graphs	2021-07-05	Paper
On maximizing a monotone $k$-submodular function under a knapsack constraint	2021-05-31	Paper
Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game	2021-03-11	Paper
Mechanism design for two-opposite-facility location games with penalties on distance	2018-11-08	Paper
Covering triangles in edge-weighted graphs	2018-08-03	Paper
Approximation algorithms on $k-$ cycle covering and $k-$ clique covering	2018-07-18	Paper
Algorithms for the ring star problem	2018-03-26	Paper
Total Dual Integrality of Triangle Covering	2017-02-01	Paper
Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles	2016-09-29	Paper

Research outcomes over time

This page was built for person: Zhongzheng Tang