( en | de | ru )

 

Disambiguation of "Tang, Zhongzheng"

Author of the publication

copydeleteadd this publication to your clipboard
Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles.

, , , and . IWOCA, volume 9843 of Lecture Notes in Computer Science, page 266-277. Springer, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Tang Tang

Junhua Tang

Fei Tang

Jian Tang

Xinhua Tang

 

Other publications of authors with the same name

Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game., , , and . Inf. Process. Lett., (2021)On maximizing a monotone k-submodular function under a knapsack constraint., , and . CoRR, (2021)Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles., , , and . IWOCA, volume 9843 of Lecture Notes in Computer Science, page 266-277. Springer, (2016)Greedy+Max: An Efficient Approximation Algorithm for k-Submodular Knapsack Maximization., , , , and . COCOA (1), volume 14461 of Lecture Notes in Computer Science, page 287-299. Springer, (2023)Noise-Resilient Similarity Preserving Network Embedding for Social Networks., , , , and . IJCAI, page 3282-3288. ijcai.org, (2019)A sharp upper bound for the transversal number of k-uniform connected hypergraphs with given size., , , and . J. Comb. Optim., 45 (1): 37 (2023)An Improved Analysis of the Greedy+Singleton Algorithm for k-Submodular Knapsack Maximization., , and . IJTCS-FAW, volume 13933 of Lecture Notes in Computer Science, page 15-28. Springer, (2023)On the Transversal Number of k-Uniform Connected Hypergraphs., , , and . AAIM, volume 13513 of Lecture Notes in Computer Science, page 376-387. Springer, (2022)Mechanism Design for Two-Opposite-Facility Location Games with Penalties on Distance., , , , , and . SAGT, volume 11059 of Lecture Notes in Computer Science, page 256-260. Springer, (2018)On maximizing a monotone k-submodular function under a knapsack constraint., , and . Oper. Res. Lett., 50 (1): 28-31 (2022)