A greedy algorithm achieves 0.4-approximation for submodular max-min allocation with identical valuations and yields the first constant upper bound on the configuration LP integrality gap.
Simultaneous placement and scheduling of sensors.2009 International Conference on Information Processing in Sensor Networks, pages 181–192,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Submodular Max-Min Allocation under Identical Valuations
A greedy algorithm achieves 0.4-approximation for submodular max-min allocation with identical valuations and yields the first constant upper bound on the configuration LP integrality gap.