arbiter
JournalsPricingAccount

Efficient Deterministic Bicriteria Approximation Algorithms for k -Submodular Cover Problem

Hue T. Nguyen et al.

Asia-Pacific Journal of Operational Research2026https://doi.org/10.1142/s0217595926500144article
AJG 1
Weight
0.50

What the paper says

We study the k-Submodular Cover (kSC) problem over a ground set V of size n, where the goal is to find k disjoint subsets of V with minimum cost such that a k-submodular utility function exceeds a given threshold. This problem generalizes the well-known Submodular Cover (SC) problem and has numerous applications in artificial intelligence and combinatorial optimization. However, existing approximation algorithms for kSC may not run in polynomial time. In this work, we propose two bicriteria approximation algorithms that not only improve the performance guarantees but also significantly reduce the query complexity compared to the state-of-the-art algorithms.

Open paper page →

Cite this paper

https://doi.org/https://doi.org/10.1142/s0217595926500144

Or copy a formatted citation

@article{hue2026,
  title        = {{Efficient Deterministic Bicriteria Approximation Algorithms for k -Submodular Cover Problem}},
  author       = {Hue T. Nguyen et al.},
  journal      = {Asia-Pacific Journal of Operational Research},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.1142/s0217595926500144},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

Efficient Deterministic Bicriteria Approximation Algorithms for k -Submodular Cover Problem

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.