Image de couverture de livre

Computing Approximate Pareto Frontiers for Submodular Utility and Cost Tradeoffs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Vombatkere, Karan, Terzi, Evimaria
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms Discrete Mathematics Social and Information Networks
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Forming Coordinated Teams that Balance Task Coverage and Expert Workload
par: Vombatkere, Karan, et autres
Publié: (2025)

A QUBO Framework for Team Formation
par: Vombatkere, Karan, et autres
Publié: (2025)

An Approximation Algorithm for Monotone Submodular Cost Allocation
par: Mizutani, Ryuhei
Publié: (2025)

A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
par: Basu, Sabyasachi, et autres
Publié: (2024)

Approximating Submodular Matroid-Constrained Partitioning
par: Bérczi, Kristóf, et autres
Publié: (2025)

Staying Fresh: Efficient Algorithms for Timely Social Information Distribution
par: Li, Songhua, et autres
Publié: (2023)

Aggregating maximal cliques in real-world graphs
par: Alon, Noga, et autres
Publié: (2025)

Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
par: Davot, Tom, et autres
Publié: (2024)

Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods
par: Huang, Yufan, et autres
Publié: (2023)

Spectral Triadic Decompositions of Real-World Networks
par: Basu, Sabyasachi, et autres
Publié: (2022)

An Exact Solver for Submodular Knapsack Problems
par: Münch, Sabine, et autres
Publié: (2025)

Parameterized Complexity of Submodular Minimization under Uncertainty
par: Kakimura, Naonori, et autres
Publié: (2024)

A Unified Approach to Minimizing Symmetric Submodular Functions
par: Iwata, Satoru, et autres
Publié: (2026)

A 1/2-Approximation for Budgeted $k$-Submodular Maximization
par: Wang, Chenhao
Publié: (2025)

Maximizing a Submodular Function with Bounded Curvature under an Unknown Knapsack Constraint
par: Klimm, Max, et autres
Publié: (2022)

Cuts and Gauges for Submodular Width
par: Lanzinger, Matthias
Publié: (2026)

Random Abstract Cell Complexes
par: Hoppe, Josef, et autres
Publié: (2024)

Hypergraphs as Weighted Directed Self-Looped Graphs: Spectral Properties, Clustering, Cheeger Inequality
par: Li, Zihao, et autres
Publié: (2024)

Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint
par: Tukan, Murad, et autres
Publié: (2024)

Approximation Algorithms for Optimal Hopsets
par: Dinitz, Michael, et autres
Publié: (2025)

Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics
par: Ameli, Afrouz Jabal, et autres
Publié: (2026)

(Approximate) Matrix Multiplication via Convolutions
par: Uffenheimer, Yahel, et autres
Publié: (2025)

An Approximate Generalization of the Okamura-Seymour Theorem
par: Kumar, Nikhil
Publié: (2022)

Approximate Realizations for Outerplanaric Degree Sequences
par: Bar-Noy, Amotz, et autres
Publié: (2024)

A Constant-Factor Approximation for Directed Latency
par: Blauth, Jannis, et autres
Publié: (2025)

Exponential Time Approximation for Coloring 3-Colorable Graphs
par: Guruswami, Venkatesan, et autres
Publié: (2024)

Approximation algorithms for non-sequential star packing problems
par: Hu, Mengyuan, et autres
Publié: (2024)

Approximation of Spanning Tree Congestion using Hereditary Bisection
par: Kolman, Petr
Publié: (2024)

Approximately covering vertices by order-$5$ or longer paths
par: Gong, Mingyang, et autres
Publié: (2024)

Approximating Maximum Edge 2-Coloring by Normalizing Graphs
par: Mömke, Tobias, et autres
Publié: (2024)

Unsplittable Cost Flows from Unweighted Error-Bounded Variants
par: Swamy, Chaitanya, et autres
Publié: (2025)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
par: Wang, Chen, et autres
Publié: (2024)

Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem
par: Disser, Yann, et autres
Publié: (2024)

Simultaneously Approximating All $\ell_p$-norms in Correlation Clustering
par: Davies, Sami, et autres
Publié: (2023)

Approximation Algorithms for the $b$-Matching and List-Restricted Variants of MaxQAP
par: Nanta, Jiratchaphat, et autres
Publié: (2025)

A Constant-Approximation Algorithm for Budgeted Sweep Coverage with Mobile Sensors
par: Liang, Wei, et autres
Publié: (2024)

On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems
par: DeHaan, Ian, et autres
Publié: (2025)

Discretely Beyond $1/e$: Guided Combinatorial Algorithms for Submodular Maximization
par: Chen, Yixin, et autres
Publié: (2024)

ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization
par: Gallart, Joan Vendrell, et autres
Publié: (2025)

Deletion-correcting codes for an adversarial nanopore channel
par: Xie, Huiling, et autres
Publié: (2026)