ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “submodular functions”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.DSTheoreticalRecentOct 19, 2026

A Tight Oracle Threshold for \(k\)-Submodular Maximization

Siyuan Chen

The paper proves a lower bound on the number of value-oracle queries required for a certain type of approximation algorithm.

View →
cs.DSTheoreticalRecentJun 18, 2026

Sparsify Submodular Functions under Cardinality Constraints

Zhengting Bao, Dongrun Cai, Xue Chen

The paper studies submodular sparsification and provides efficient constructions of size-$O(n k^2 \log n)$ sparsifiers for summations of arbitrary submodular functions under cardinality constraints.

View →
cs.DSTheoreticalRecentJun 18, 2026

Tight Algorithm and Hardness for Submodular Linear Ordering

Evan Abboud, Roy Schwartz

The paper resolves the approximability of the Minimum Linear Ordering Problem for a general submodular function.

View →
cs.DScs.DMTheoreticalRecentJul 23, 2026

Approximation Algorithms for Inventory Problems with Decomposable Submodular Ordering Costs

Retsef Levi, Georgia Perakis, Emily Zhang

This paper proposes an approximation algorithm for the submodular joint replenishment problem with decomposable submodular ordering cost functions, achieving an O(k)-approximation.

View →
cs.DScs.CRRecentJun 4, 2026

Multi-Objective Submodular Maximization with Differential Privacy

Ting Hou, Yanhao Wang, Yiping Wang, Cen Chen +2 more

This paper addresses the challenging problem of multi-objective submodular maximization under a cardinality constraint while ensuring differential privacy, proposing novel algorithms with approximatio…

View →
cs.DScs.LGstat.MLRecentJun 3, 2026

A General Framework for Dynamic Consistent Submodular Maximization

Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard +2 more

The paper develops a general framework for dynamic consistent submodular maximization, achieving constant-factor approximations with sublinear consistency for both cardinality and rank-$k$ matroid con…

View →
cs.DSTheoreticalRecentJun 21, 2026

Submodular Welfare Maximization with Budget Constraints in the Random-Order Model

Max Klimm, Martin Knaack

This paper presents improved algorithms for an online item-allocation problem with budgets and a submodular objective.

View →
cs.DSTheoreticalRecentJun 26, 2026

Incremental Submodular Maximization: Better Than Greedy

Marcin Bienkowski, Joakim Blikstad, Jarosław Byrka, Martín Costa +2 more

The paper presents an adaptive scaling algorithm with a competitive ratio of 1.373 for incremental submodular maximization under increasing cardinality constraint, improving upon the previous best res…

View →
cs.CCTheoreticalRecentJul 31, 2026

On the Complexity of Computing Outputs of a Metric Turing Machine

Yaroslav Ivanashev

This paper introduces classes of functions that compute the k-th solution for certain types of problems and proves their inter-reducibility with corresponding classes for different order functions. It…

View →
cs.LGcs.NEcs.SCTheoreticalRecentJun 22, 2026

EML Trees Are Universal Approximators

Joe Germany, Elie Abdo, Joseph Bakarji

This paper studies the expressive power of tree-structured compositions of EML functions for function approximation.

View →
math.PRcs.DMcs.FLTheoreticalRecentJun 28, 2026

Note on Finite-Automata Bernoulli Factories for Rational Functions

Renato Paes Leme, Jon Schneider

This paper identifies a technical oversight in Mossel and Peres (2005) theorem on designing Bernoulli factories for multivariable functions and provides a counterexample.

View →
cs.DScs.CCTheoreticalRecentJul 31, 2026

A Subsampling Theorem for Constraint Satisfaction Problems with Large Arity

Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Gabriele Farina +1 more

The paper presents a new subsampling theorem for Constraint Satisfaction Problems (CSPs) with improved sample size requirements.

View →
math.COcs.DMmath.CTTheoreticalRecentJul 9, 2026

Subword representations and weak hypercube dimension for acyclic categories

Isaac Carcacía-Campos

This paper introduces a new way to represent finite posets as subwords of finite words in categories, and characterizes the monic categories that admit this representation.

View →
cs.CLcs.AIRecentJun 1, 2026

From Layers to Submodules: Rethinking Granularity in Replacement-Based LLM Compression

Elia Cunegatti, Marcus Vukojevic, Erik Nielsen, Giovanni Iacca

The paper proposes SubFit, a novel compression technique that achieves superior LLM compression by replacing non-contiguous, submodule-level components (Attention and FeedForward) with lightweight res…

View →