Author:
Chakrabarti Amit,Kale Sagar
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference21 articles.
1. Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: On graph problems in a semi-streaming model. Theor. Comput. Sci. 348(2), 207 (2005). doi: 10.1016/j.tcs.2005.09.013
2. McGregor, A.: Proceedings of the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp. 170–181. Springer, Berlin, Heidelberg (2005). APPROX’05/RANDOM’05. doi: 10.1007/11538462_15
3. Zelke, M.: Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, pp. 669–680 (2008). STACS ’08
4. Epstein, L., Levin, A., Mestre, J., Segev, D.: Improved approximation guarantees for weighted matching in the semi-streaming model. SIAM J. Discrete Math. 25(3), 1251 (2011). doi: 10.1137/100801901
5. Goel, A., Kapralov, M., Khanna, S.: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 468–485. SIAM (2012). SODA ’12. http://dl.acm.org/citation.cfm?id=2095116.2095157
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Semi-streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints;Algorithmica;2024-09-14
2. Submodular Order Functions and Assortment Optimization;Management Science;2024-04-01
3. View-based Explanations for Graph Neural Networks;Proceedings of the ACM on Management of Data;2024-03-12
4. A Distributed Augmenting Path Approach for the Bottleneck Assignment Problem;IEEE Transactions on Automatic Control;2024-02
5. Deletion-Robust Submodular Maximization under a Knapsack Constraint;2023 IEEE International Conference on High Performance Computing & Communications, Data Science & Systems, Smart City & Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC/DSS/SmartCity/DependSys);2023-12-17