Approximation Algorithms for Norm-Budgeted Packing Problems

David Aleman Espinosa; Sharat Ibrahimpur; Chaitanya Swamy

Home/Archive/arXiv

arXiv · 2607.12437

Approximation Algorithms for Norm-Budgeted Packing Problems

David Aleman Espinosa·Sharat Ibrahimpur·Chaitanya Swamy

View original source ↗Read source document ↗Export metadata ↓

Abstract

In recent years, much attention has been devoted to the study of optimization problems under norm-based objectives coming from the rich class of monotone, symmetric norms (and their generalizations). This work has however almost exclusively focused on covering problems, wherein one seeks to minimize the norm of the cost vector induced by a solution. We introduce and study the class of {\em norm-budgeted packing problems}, which are packing problems where the resource constraints underlying the packing problem are modeled via a {\em norm budget constraint} involving a {\em monotone, symmetric norm}. Formally, we have some elements with associated rewards and sizes, a downwards-closed collection of feasible solutions, and a budget $B$. Each solution induces a size vector, and the goal is to maximize the total reward subject to the norm-budget constraint $f(\text{size vector})\leq B$. The versatility of monotone, symmetric norms implies that a variety of classical packing problems can be captured under the umbrella of norm-budgeted packing problems. Moreover, the closure properties of monotone, symmetric norms, also enable one to encode multiple different norm-budget constraints via a single monotone, symmetric norm. We consider the norm-budgeted versions of a variety of canonical packing problems, including knapsack, matching, maximum-weight independent set in a $k$-set system, maximum generalized assignment problem (MaxGAP), and $k$-facility location, and develop a framework that allows us to obtain {\em constant-factor approximation guarantees} for these problems, and {\em PTASes for knapsack, and MaxGAP on identical and related machines}. We also develop constant-factor approximation algorithms for the {\em submodular} versions of some norm-budgeted packing problems, wherein the reward function is now specified by a monotone, submodular function.

Explore related subjects

cs.DS

Keep this discovery

BibTeX RIS

David Aleman Espinosa, Sharat Ibrahimpur, Chaitanya Swamy. 2026-07-14. Approximation Algorithms for Norm-Budgeted Packing Problems. https://arxiv.org/abs/2607.12437

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗

arXiv2026

A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix

For every fixed $0<\varepsilon\le1$, we give a deterministic strongly polynomial algorithm that, given a nonnegative matrix $A\in\mathbb{R}_{\ge0}^{n\times n}$, returns $Q$ satisfying $\operatorname{per} A\le Q\le(1+\varepsilon)^n\operatorname{per} A$.

cs.DS↗

arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗