Author:
Barman Siddharth,Fawzi Omar,Ghoshal Suprovat,Gürpınar Emirhan
Publisher
Springer International Publishing
Reference27 articles.
1. Ageev, A.A., Sviridenko, M.I.: Pipage rounding: a new method of constructing algorithms with proven performance guarantee. J. Comb. Optim. 8(3), 307–328 (2004)
2. Barman, S., Fawzi, O.: Algorithmic aspects of optimal channel coding. IEEE Trans. Inform. Theory (2018).
arXiv:1508.04095
3. Barman, S., Fawzi, O., Ghoshal, S., Gürpınar, E.: Tight approximation bounds for maximum multi-coverage (2019).
arXiv:1905.00640
4. Berman, P., DasGupta, B., Sontag, E.: Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. Discrete Appl. Math. 155(6), 733–749 (2007).
https://doi.org/10.1016/j.dam.2004.11.009
.
http://www.sciencedirect.com/science/article/pii/S0166218X06003659
. Computational Molecular Biology Series, Issue V
5. Calinescu, G., Chekuri, C., Pál, M., Vondrák, J.: Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput. 40(6), 1740–1766 (2011)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Algorithms and Computational Complexity;SpringerBriefs in Intelligent Systems;2022-11-18
2. Optimal Algorithms for Multiwinner Elections and the Chamberlin-Courant Rule;Proceedings of the 22nd ACM Conference on Economics and Computation;2021-07-18
3. Fine-Grained Complexity and Algorithms for the Schulze Voting Method;Proceedings of the 22nd ACM Conference on Economics and Computation;2021-07-18
4. Tight Approximation Guarantees for Concave Coverage Problems;LEIBNIZ INT PR INFOR;2021
5. Parameterized Complexity of d-Hitting Set with Quotas;SOFSEM 2021: Theory and Practice of Computer Science;2021