5 citations · 13 across the 7 of their papers we have counts for
8 papers
When does additional information lead to longer travel time in multi-origin-destination networks?
Xujin Chen, Xiaodong Hu, Xinqi Jing +1
The Informational Braess' Paradox (IBP) illustrates a counterintuitive scenario where revelation of additional roadway segments to some self-interested travelers leads to increased…
On maximizing a monotone -submodular function under a knapsack constraint
Zhongzheng Tang, Chenhao Wang, Hau Chan
We study the problem of maximizing a non-negative monotone -submodular function under a knapsack constraint, where a -submodular function is a natural generalization of a…
Mechanism Design for Facility Location Games with Candidate Locations
Zhongzheng Tang, Chenhao Wang, Mengqi Zhang +1
We study the facility location games with candidate locations from a mechanism design perspective. Suppose there are n agents located in a metric space whose locations are their pr…
Price of Fairness in Budget Division for Egalitarian Social Welfare
Zhongzheng Tang, Chenhao Wang, Mengqi Zhang
We study a participatory budgeting problem of aggregating the preferences of agents and dividing a budget over the projects. A budget division solution is a probability distributio…
On the feedback number of 3-uniform hypergraph
Zhuo Diao, Zhongzheng Tang
Let be a hypergraph with vertex set and edge set . is a feedback vertex set (FVS) of if has no cycle and denote the mini…
Approximation algorithms on cycle covering and clique covering
Zhongzheng Tang, Zhuo Diao
Given a weighted graph with weight . A cycle covering is an edge subset of such that has no cycle. The minimum w…
Mechanism Design for Two-Opposite-Facility Location Games with Penalties on Distance
Xujin Chen, Xiaodong Hu, Xiaohua Jia +3
This paper is devoted to the two-opposite-facility location games with a penalty whose amount depends on the distance between the two facilities to be opened by an authority. The t…
Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles
Xujin Chen, Zhuo Diao, Xiaodong Hu +1
Given a simple graph , a subset of is called a triangle cover if it intersects each triangle of . Let and denote the maximum number of pairwise ed…