Fast algorithms for monotone submodular meta-learning under the cardinality constraint

DOI10.1007/S10878-026-01446-ZMaRDI QIDQ7346902zbMATH OpenFDO

Authors Shufang Gong, Bin Liu, Qizhi Fang, Weili Wu

Publication date 11 September 2026

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10878-026-01446-Z

Mathematics Subject Classification ID

Approximation algorithms (68W25) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Mathematical programming (90Cxx)

Cites work

• A constrained two-stage submodular maximization
• A fast algorithm for submodular maximization with a matroid constraint
• A note on maximizing a submodular set function subject to a knapsack constraint
• A Unified Continuous Greedy Algorithm for Submodular Maximization
• Constrained submodular maximization via greedy local search
• Fast algorithms for maximizing submodular functions
• Title not available (Why is no real title available?)
• Monotone submodular maximization over a matroid via non-oblivious local search
• Practical budgeted submodular maximization
• Submodular maximization meets streaming: matchings, matroids, and more

This page was built for publication: Fast algorithms for monotone submodular meta-learning under the cardinality constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346902)