Combinatorial approximation algorithms for the maximum directed cut problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Non-monotone submodular maximization under matroid and knapsack constraints
Proceedings of the forty-first annual ACM symposium on Theory of computing
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
SIAM Journal on Discrete Mathematics
Maximizing Non-monotone Submodular Functions
SIAM Journal on Computing
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
| Hi-index | 0.01 |