3 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.DS2020★ 3 cited
A Simple 1-1/e Approximation for Oblivious Bipartite Matching
Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang
We study the oblivious matching problem, which aims at finding a maximum matching on a graph with unknown edge set. Any algorithm for the problem specifies an ordering of the verte…
cs.GT2019
Defending with Shared Resources on a Network
Minming Li, Long Tran-Thanh, Xiaowei Wu
In this paper we consider a defending problem on a network. In the model, the defender holds a total defending resource of R, which can be distributed to the nodes of the network.…
cs.DM2016
On (, )-Restricted Max-Min Fair Allocation Problem
T-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu
We study the max-min fair allocation problem in which a set of indivisible items are to be distributed among agents such that the minimum utility among all agents is maximi…