,
Hirotaka Ono
,
Suguru Yamada
Creative Commons Attribution 4.0 International license
We study Cardinality-constrained Set Function Maximization over Graphs (CC-SFMG), a framework for cardinality-constrained maximization of graph-local set functions, and its connected variant Connected CC-SFMG. This framework captures a wide range of combinatorial optimization problems, including Maximum k-Coverage and Fixed-Cardinality Graph Partitioning (FCGP), the latter of which generalizes Densest k-Subgraph, Max k-Vertex Cover, and Max (k,n-k)-Cut. Although CC-SFMG is expressively equivalent to cardinality-constrained set function maximization on complete graphs, locality yields a useful organizing principle on sparse graphs. We show that several algorithmic results previously obtained for broad but separate classes of graph optimization problems, most notably FCGP, can be reinterpreted and extended within a single framework, where the relevant algorithmic regime is governed by properties of the objective function, such as submodularity, supermodularity, and nonnegativity or nonpositivity. In particular, this viewpoint lifts existing sparse-graph results from individual problems to broader classes of graph-local objectives. In this paper, we obtain various FPT results for CC-SFMG and Connected CC-SFMG with respect to combinations of the solution size and structural graph parameters (such as degeneracy, maximum degree, and treewidth), under objective function properties such as submodularity or supermodularity. Under additional assumptions controlling the strength of local interactions, we further present FPT approximation schemes for CC-SFMG and Connected CC-SFMG parameterized by the solution size, for nonnegative or nonpositive objective functions. For CC-SFMG, we additionally require submodularity or supermodularity. Our results unify and extend prior results for FCGP within a broader locality-based framework.
@InProceedings{hanaka_et_al:LIPIcs.IPEC.2026.23,
author = {Hanaka, Tesshu and Ono, Hirotaka and Yamada, Suguru},
title = {{Set Function Maximization with Locality over Graphs}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {23:1--23:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-456-7},
ISSN = {1868-8969},
year = {2026},
volume = {398},
editor = {Korhonen, Tuukka and Lampis, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2026.23},
URN = {urn:nbn:de:0030-drops-281966},
doi = {10.4230/LIPIcs.IPEC.2026.23},
annote = {Keywords: Set function maximization, locality, graph algorithms}
}