Triangle packing and covering in dense random graphs von Tang, Zhongzheng, Diao, Zhuo

Volltext

Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number von Tang, Zhongzheng, Tang, Yucong, Diao, Zhuo

Volltext

A sharp upper bound for the transversal number of k-uniform connected hypergraphs with given size von Chen, Zian, Chen, Bin, Tang, Zhongzheng, Diao, Zhuo

Volltext

Algorithms for the metric ring star problem with fixed edge-cost ratio von Chen, Xujin, Hu, Xiaodong, Jia, Xiaohua, Tang, Zhongzheng, Wang, Chenhao, Zhang, Ying

Volltext

Greedy+Singleton: An efficient approximation algorithm for k-submodular knapsack maximization von Tang, Zhongzheng, Chen, Jingwen, Wang, Chenhao

Volltext

On maximizing a monotone k-submodular function under a knapsack constraint von Tang, Zhongzheng, Wang, Chenhao, Chan, Hau

Volltext

Monotone k-submodular secretary problems: Cardinality and knapsack constraints von Tang, Zhongzheng, Wang, Chenhao, Chan, Hau

Volltext

A sharp lower bound on the independence number of k-regular connected hypergraphs with rank R von Tang, Zhongzheng, Zou, Haoyang, Diao, Zhuo

Volltext

Data Placement and Transmission Scheduling for coded multicast in mobile edge networks von Tang, Zhongzheng, Yu, Nuo, Jia, Xiaohua, Hu, Xiaodong

Volltext

Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game von Chen, Xujin, Hu, Xiaodong, Tang, Zhongzheng, Wang, Chenhao

Volltext

Some Combinatorial Algorithms on the Dominating Number of Anti-rank k Hypergraphs von Diao, Zhuo, Tang, Zhongzheng

Volltext

On the Transversal Number of Rank k Hypergraphs von Tang, Zhongzheng, Diao, Zhuo

Volltext

Some New Results on Gallai Theorem and Perfect Matching for k-Uniform Hypergraphs von Tang, Zhongzheng, Diao, Zhuo

Volltext

Coded multicasting in cache-enabled vehicular ad hoc network von Bao, Haizhou, Huang, Chuanhe, Tang, Zhongzheng, Li, Qihui, Ni, Qiufen, Dong, Xiaodai, Fu, Bin

Volltext

Approximation Algorithms for Balancing Signed Graphs von Diao, Zhuo, Tang, Zhongzheng

Volltext

Some Combinatorial Algorithms on the Edge Cover Number of k-Regular Connected Hypergraphs von Tang, Zhongzheng, Li, Yaxuan, Diao, Zhuo

Volltext

Profit Maximization for Competitive Influence Spread in Social Networks von Ni, Qiufen, Bai, Yun, Tang, Zhongzheng

Volltext

Intellicise Router Promotes Endogenous Intelligence in Communication Network von Guo, Qiyun, Liang, Haotai, Bao, Zhicheng, Dong, Chen, Xu, Xiaodong, Tang, Zhongzheng, Bei, Yue

Volltext

Covering Triangles in Edge-Weighted Graphs von Chen, Xujin, Diao, Zhuo, Hu, Xiaodong, Tang, Zhongzheng

Volltext

On the Matching Number of k-Uniform Connected Hypergraphs with Maximum Degree von Tang, Zhongzheng, Zou, Haoyang, Diao, Zhuo

Volltext