New random-order semi-streaming algorithms improve approximation guarantees over adversarial-order results for submodular maximization under matroids and related constraints, with an exponential reduction in passes needed for near-optimal matroid results.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
Two novel neighborhood structures for incomplete round-robin tournament scheduling are introduced, with one proven to connect the full solution space, leading to new best solutions via an adaptive late acceptance hill-climbing algorithm.
citing papers explorer
-
Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order
New random-order semi-streaming algorithms improve approximation guarantees over adversarial-order results for submodular maximization under matroids and related constraints, with an exponential reduction in passes needed for near-optimal matroid results.
-
Novel neighborhood structures for incomplete round robin sports tournaments
Two novel neighborhood structures for incomplete round-robin tournament scheduling are introduced, with one proven to connect the full solution space, leading to new best solutions via an adaptive late acceptance hill-climbing algorithm.