New Approximations and Hardness Results for Submodular Partitioning Problems

Richard Santiago. New Approximations and Hardness Results for Submodular Partitioning Problems. In Paola Flocchini, Lucia Moura, editors, Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5-7, 2021, Proceedings. Volume 12757 of Lecture Notes in Computer Science, pages 516-530, Springer, 2021. [doi]

Authors

Richard Santiago

This author has not been identified. Look up 'Richard Santiago' in Google