An Improved Approximation for Maximum Weighted k -Set Packing
Attributed to:
Practical Submodular Optimisation Beyond the Standard Greedy Algorithm
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1137/1.9781611977554.ch42
Publication URI: http://dx.doi.org/10.1137/1.9781611977554.ch42
Type: Book Chapter
Book Title: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2023)
Page Reference: 1138-1162