Author:
Huang Norman,Borodin Allan
Publisher
Springer International Publishing
Reference24 articles.
1. Alon, N., Bollobás, B., Gyárfás, A., Lehel, J., Scott, A.: Maximum directed cuts in acyclic digraphs. Journal of Graph Theory 55, 1–13 (2007)
2. Bar-Noy, A., Lampis, M.: Online maximum directed cut. Journal of Combinatorial Optimization 24, 52–64 (2012)
3. Borodin, A., Nielsen, M.N., Rackoff, C.: (Incremental) priority algorithms. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002, pp. 752–761. Society for Industrial and Applied Mathematics, Philadelphia (2002)
4. Buchbinder, N., Feldman, M. Naor, J.S., Schwartz, R.: A tight linear time (1/2)-approximation for unconstrained submodular maximization. In: Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, FOCS 2012, pp. 649–658. IEEE Computer Society, Washington, DC (2012)
5. Calinescu, G., Chekuri, C., Pál, M., Vondrák, J.: Maximizing a submodular set function subject to a matroid constraint. In: Integer Programming and Combinatorial Optimization, pp. 182–196. Springer (2007)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献