Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem

📝 Original Info

• Title: Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
• ArXiv ID: 2511.00869
• Date: 2025-11-02
• Authors: ** 논문에 명시된 저자 정보가 제공되지 않았습니다. (필요 시 원문 혹은 DOI를 확인해 주세요.) **

📝 Abstract

We study the $k$-Submodular Cover ($kSC$) problem, a natural generalization of the classical Submodular Cover problem that arises in artificial intelligence and combinatorial optimization tasks such as influence maximization, resource allocation, and sensor placement. Existing algorithms for $\kSC$ often provide weak approximation guarantees or incur prohibitively high query complexity. To overcome these limitations, we propose a \textit{Fast Stochastic Greedy} algorithm that achieves strong bicriteria approximation while substantially lowering query complexity compared to state-of-the-art methods. Our approach dramatically reduces the number of function evaluations, making it highly scalable and practical for large-scale real-world AI applications where efficiency is essential.

💡 Deep Analysis

📄 Full Content

📸 Image Gallery

Reference