From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Some Combinatorial Algorithms on the Edge Cover Number of k-Regular Connected Hypergraphs.

Z. Tang, Y. Li, и Z. Diao. TAMC, том 14637 из Lecture Notes in Computer Science, стр. 284-295. Springer, (2024)

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.

Tang Tang

Fei Tang

Junhua Tang

Jian Tang

Yu Tang

Другие публикации лиц с тем же именем

Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game.X. Chen, X. Hu, Z. Tang, и C. Wang. Inf. Process. Lett., (2021)On maximizing a monotone k-submodular function under a knapsack constraint.Z. Tang, C. Wang, и H. Chan. CoRR, (2021)Greedy+Max: An Efficient Approximation Algorithm for k-Submodular Knapsack Maximization.Z. Tang, J. Chen, C. Wang, T. Wang, и W. Jia. COCOA (1), том 14461 из Lecture Notes in Computer Science, стр. 287-299. Springer, (2023)Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles.X. Chen, Z. Diao, X. Hu, и Z. Tang. IWOCA, том 9843 из Lecture Notes in Computer Science, стр. 266-277. Springer, (2016)Noise-Resilient Similarity Preserving Network Embedding for Social Networks.Z. Qiu, W. Hu, J. Wu, Z. Tang, и X. Jia. IJCAI, стр. 3282-3288. ijcai.org, (2019)An Improved Analysis of the Greedy+Singleton Algorithm for k-Submodular Knapsack Maximization.Z. Tang, J. Chen, и C. Wang. IJTCS-FAW, том 13933 из Lecture Notes in Computer Science, стр. 15-28. Springer, (2023)A sharp upper bound for the transversal number of k-uniform connected hypergraphs with given size.Z. Chen, B. Chen, Z. Tang, и Z. Diao. J. Comb. Optim., 45 (1): 37 (2023)On the Transversal Number of k-Uniform Connected Hypergraphs.Z. Chen, B. Chen, Z. Tang, и Z. Diao. AAIM, том 13513 из Lecture Notes in Computer Science, стр. 376-387. Springer, (2022)Mechanism Design for Two-Opposite-Facility Location Games with Penalties on Distance.X. Chen, X. Hu, X. Jia, M. Li, Z. Tang, и C. Wang. SAGT, том 11059 из Lecture Notes in Computer Science, стр. 256-260. Springer, (2018)Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number.Z. Tang, Y. Tang, и Z. Diao. J. Comb. Optim., 44 (5): 3310-3330 (2022)

BibSonomy

Disambiguation