A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A combinatorial strongly polynomial algorithm for minimizing submodular functions
Journal of the ACM (JACM)
An improved approximation algorithm for combinatorial auctions with submodular bidders
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Some new cooperative coverage facility location games
Proceedings of the Behavioral and Quantitative Game Theory: Conference on Future Directions
Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
Discrete Applied Mathematics
| Hi-index | 0.04 |