An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximating the two-level facility location problem via a quasi-greedy approach
SODA '04 Proceedings of the fifteenth 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
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Submodular secretary problem and extensions
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
SIAM Journal on 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 note on the maximization version of the multi-level facility location problem
Operations Research Letters
Operations Research Letters
Submodular secretary problem and extensions
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.04 |