Skip to main navigation Skip to search Skip to main content

Beyond Pointwise Submodularity: Non-monotone Adaptive Submodular Maximization Subject to Knapsack and k-System Constraints

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

Although the knapsack-constrained and k-system-constrained non-monotone adaptive submodular maximization have been well studied in the literature, it has only been settled given the additional assumption of pointwise submodularity. In this paper, we remove the common assumption on pointwise submodularity and propose the first approximation solutions for both knapsack and k-system constrained adaptive submodular maximization problems. Inspired by two recent studies on non-monotone adaptive submodular maximization, we develop a sampling-based randomized algorithm that achieves a 110 approximation for the case of a knapsack constraint and that achieves a 12k+4 approximation ratio for the case of a k-system constraint.

Original languageEnglish
Title of host publicationModelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 4th International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences - MCO 2021
EditorsHoai An Le Thi, Hoai Minh Le, Hoai An Le Thi, Tao Pham Dinh
PublisherSpringer Science and Business Media Deutschland GmbH
Pages16-27
Number of pages12
ISBN (Print)9783030926656
DOIs
StatePublished - 2022
Event4th International conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, MCO 2021 - Hanoi, Viet Nam
Duration: Dec 11 2021Dec 13 2021

Publication series

NameLecture Notes in Networks and Systems
Volume363 LNNS
ISSN (Print)2367-3370
ISSN (Electronic)2367-3389

Conference

Conference4th International conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, MCO 2021
Country/TerritoryViet Nam
CityHanoi
Period12/11/2112/13/21

Keywords

  • Adaptive submodularity
  • Approximation algorithms
  • Non-monotonicity

Fingerprint

Dive into the research topics of 'Beyond Pointwise Submodularity: Non-monotone Adaptive Submodular Maximization Subject to Knapsack and k-System Constraints'. Together they form a unique fingerprint.

Cite this