Moran Feldman
TitleCited byYear
A tight linear time (1/2)-approximation for unconstrained submodular maximization
N Buchbinder, M Feldman, J Seffi, R Schwartz
SIAM Journal on Computing 44 (5), 1384-1402, 2015
3072015
Automatic construction of travel itineraries using social breadcrumbs
M De Choudhury, M Feldman, S Amer-Yahia, N Golbandi, R Lempel, ...
Proceedings of the 21st ACM conference on Hypertext and hypermedia, 35-44, 2010
2902010
A unified continuous greedy algorithm for submodular maximization
M Feldman, J Naor, R Schwartz
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 570-579, 2011
1662011
Submodular maximization with cardinality constraints
N Buchbinder, M Feldman, JS Naor, R Schwartz
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete …, 2014
1592014
Improved approximation algorithms for directed steiner forest
M Feldman, G Kortsarz, Z Nutov
Journal of Computer and System Sciences 78 (1), 279-292, 2012
752012
A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem
M Feldman, O Svensson, R Zenklusen
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014
672014
Distributed decision and control for cooperative UAVs using ad hoc communication
Y Ben-Asher, S Feldman, P Gurfil, M Feldman
IEEE Transactions on control systems technology 16 (3), 511-516, 2008
602008
Deterministic algorithms for submodular maximization problems
N Buchbinder, M Feldman
ACM Transactions on Algorithms (TALG) 14 (3), 32, 2018
532018
Constructing travel itineraries from tagged geo-temporal breadcrumbs
M De Choudhury, M Feldman, S Amer-Yahia, N Golbandi, R Lempel, ...
Proceedings of the 19th international conference on World wide web, 1083-1084, 2010
522010
Improved competitive ratios for submodular secretary problems
M Feldman, JS Naor, R Schwartz
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2011
482011
Streaming weak submodularity: Interpreting neural networks on the fly
E Elenberg, AG Dimakis, M Feldman, A Karbasi
Advances in Neural Information Processing Systems, 4044-4054, 2017
462017
Nonmonotone submodular maximization via a structural continuous greedy algorithm
M Feldman, JS Naor, R Schwartz
International Colloquium on Automata, Languages, and Programming, 342-353, 2011
452011
Greed is Good: Near-Optimal Submodular Maximization via Greedy Optimization
M Feldman, C Harshaw, A Karbasi
arXiv preprint arXiv:1704.01652, 2017
402017
Online contention resolution schemes
M Feldman, O Svensson, R Zenklusen
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016
402016
Hedonic clustering games
M Feldman, L Lewin-Eytan, JS Naor
ACM Transactions on Parallel Computing 2 (1), 4, 2015
402015
Online submodular maximization with preemption
N Buchbinder, M Feldman, R Schwartz
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
362014
The submodular secretary problem goes linear
M Feldman, R Zenklusen
SIAM Journal on Computing 47 (2), 330-366, 2018
342018
Constrained submodular maximization via a nonsymmetric technique
N Buchbinder, M Feldman
Mathematics of Operations Research, 2019
322019
Comparing apples and oranges: query tradeoff in submodular maximization
N Buchbinder, M Feldman, R Schwartz
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2015
302015
Constrained Monotone Function Maximization and the Supermodular Degree
M Feldman, R Izsak
arXiv preprint arXiv:1407.6328, 2014
302014
The system can't perform the operation now. Try again later.
Articles 1–20