Zhongzheng Tang

Jingwen Chen

Theor. Comput. Sci., February, 2024

When does additional information lead to longer travel time in multi-origin-destination networks?

[BibT_eX]

[DOI]

CoRR, 2024

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

[BibT_eX]

[DOI]

Yaxuan Li

Proceedings of the Theory and Applications of Models of Computation, 2024

2023

Data Placement and Transmission Scheduling for coded multicast in mobile edge networks.

[BibT_eX]

[DOI]

Comput. Commun., July, 2023

A sharp upper bound for the transversal number of k-uniform connected hypergraphs with given size.

[BibT_eX]

[DOI]

J. Comb. Optim., 2023

On the Matching Number of k-Uniform Connected Hypergraphs with Maximum Degree.

[BibT_eX]

[DOI]

Haoyang Zou

Proceedings of the Frontiers of Algorithmics - 17th International Joint Conference, 2023

An Improved Analysis of the Greedy+Singleton Algorithm for k-Submodular Knapsack Maximization.

[BibT_eX]

[DOI]

Jingwen Chen

Proceedings of the Frontiers of Algorithmics - 17th International Joint Conference, 2023

Improved Analysis of Greedy Algorithm on k-Submodular Knapsack.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Qiufen Ni

Yun Bai

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

Greedy+Max: An Efficient Approximation Algorithm for k-Submodular Knapsack Maximization.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2023

Some Combinatorial Algorithms on the Dominating Number of Anti-rank k Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

SNIFF: A Scalable Network Inference Framework for Measuring End-to-End Performance.

[BibT_eX]

[DOI]

IEEE Trans. Netw. Sci. Eng., 2022

Monotone k-submodular secretary problems: Cardinality and knapsack constraints.

[BibT_eX]

[DOI]

Hau Chan

Theor. Comput. Sci., 2022

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

[BibT_eX]

[DOI]

Hau Chan

Oper. Res. Lett., 2022

Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number.

[BibT_eX]

[DOI]

Yucong Tang

J. Comb. Optim., 2022

Triangle packing and covering in dense random graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

SIC-based Precoding Scheme with Sub-connected Architecture for MIMO VLC Systems.

[BibT_eX]

[DOI]

Proceedings of the IEEE Global Communications Conference, 2022

On the Transversal Number of Rank k Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Algorithmic Wisdom, 2022

Some New Results on Gallai Theorem and Perfect Matching for k-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

Monotone k-Submodular Knapsack Maximization: An Analysis of the Greedy+Singleton Algorithm.

[BibT_eX]

[DOI]

Jingwen Chen

Proceedings of the Algorithmic Aspects in Information and Management, 2022

On the Transversal Number of k-Uniform Connected Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2022

2021

Algorithms for the metric ring star problem with fixed edge-cost ratio.

[BibT_eX]

[DOI]

J. Comb. Optim., 2021

Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2021

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

[BibT_eX]

[DOI]

Hau Chan

CoRR, 2021

On the Feedback Number of 3-Uniform Linear Extremal Hypergraphs.

[BibT_eX]

[DOI]

Yucong Tang

Proceedings of the Combinatorial Optimization and Applications, 2021

2020

Mechanism Design for Facility Location Games with Candidate Locations.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2020

Price of Fairness in Budget Division for Egalitarian Social Welfare.

[BibT_eX]

[DOI]

Mengqi Zhang

Proceedings of the Combinatorial Optimization and Applications, 2020

Packing and Covering Triangles in Dense Random Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2020

Approximation Algorithms for Balancing Signed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019

Coded multicasting in cache-enabled vehicular ad hoc network.

[BibT_eX]

[DOI]

Comput. Networks, 2019

Noise-Resilient Similarity Preserving Network Embedding for Social Networks.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 5th International Conference on Big Data Computing and Communications, 2019

2018

Covering Triangles in Edge-Weighted Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

Approximation algorithms on k-cycle covering and k-clique covering.

[BibT_eX]

[DOI]