# General bounds for incremental maximization

@article{Bernstein2017GeneralBF,
title={General bounds for incremental maximization},
author={Aaron Bernstein and Yann Disser and Martin Gro{\ss}},
journal={Mathematical Programming},
year={2017},
volume={191},
pages={953-979}
}
• Published 29 May 2017
• Computer Science
• Mathematical Programming
We propose a theoretical framework to capture incremental solutions to cardinality constrained maximization problems. The defining characteristic of our framework is that the cardinality/support of the solution is bounded by a value  $$k\in {\mathbb {N}}$$ k ∈ N that grows over time, and we allow the solution to be extended one element at a time. We investigate the best-possible competitive ratio of such an incremental solution, i.e., the worst ratio over all  k between the incremental solution…
5 Citations

## Figures from this paper

### Fractionally Subadditive Maximization under an Incremental Knapsack Constraint

• Mathematics, Computer Science
WAOA
• 2021
It is established that the framework captures potential-based flows between two vertices, and the tight bound of 2 is given for the incremental maximization of classical flows with unit capacities.

### Unified greedy approximability beyond submodular maximization

• Computer Science, Mathematics
ArXiv
• 2020
The new class of $\gamma$-$\alpha$-augmentable functions is proposed and it is proved that it encompasses several important subclasses, such as functions of bounded submodularity ratio, \$\alpha-augementable functions, and weighted rank functions of an independence system of bounded rank quotient.

### Incremental algorithms for the maximum internal spanning tree problem

• Mathematics
Sci. China Inf. Sci.
• 2021
An IMIST algorithm with a competitive ratio of 2, followed by a 12/7-competitive algorithm based on an approximation algorithm for MIST is obtained.

### Maximizing a Submodular Function with Bounded Curvature Under an Unknown Knapsack Constraint

• Mathematics
APPROX/RANDOM
• 2022
This paper studies the problem of maximizing a monotone submodular function under an unknown knapsack constraint. A solution to this problem is a policy that decides which item to pack next based on

### Incremental Affine Abstraction of Nonlinear Systems

• Mathematics
IEEE Control Systems Letters
• 2021
In this letter, we propose an incremental abstraction method for dynamically over-approximating nonlinear systems in a bounded domain by solving a sequence of linear programs, resulting in a sequence

## References

SHOWING 1-10 OF 57 REFERENCES

### Greedy in Approximation Algorithms

The notion of k-extendible systems is introduced, a natural generalization of matroids, and it is shown that a greedy algorithm is a 1 k-factor approximation for these systems.

### A general approach for incremental approximation and hierarchical clustering

• Computer Science, Mathematics
SODA '06
• 2006
This work presents a general framework and algorithmic approach for incremental approximation algorithms for cardinality constrained minimization problems, and gives an improved algorithm for a hierarchical version of the k-median problem introduced by Plaxton [31], and shows that the framework applies to hierarchical clustering problems.

### Computing knapsack solutions with cardinality robustness

• Mathematics, Computer Science
ISAAC
• 2011
It is shown that, for any $$nu+\varepsilon >0 }$$ , the problem of deciding whether the knapsack problem admits a ν-robust solution is weakly NP-hard, where ν denotes the rank quotient of the correspondingknapsack system.

### The online median problem

• Mathematics
Proceedings 41st Annual Symposium on Foundations of Computer Science
• 2000
This work introduces a natural variant of the (metric uncapacitated) k-median problem that is similar in spirit to the recent primal-dual-based facility location algorithm of Jain and Vazirani, but the approach is more elementary and yields an improved running time.

### Incremental Medians via Online Bidding

• Computer Science, Mathematics
Algorithmica
• 2007
The upper bound proofs reduce the incremental medians problem to the following online bidding problem: faced with some unknown threshold T∈ℝ+, an algorithm must submit “bids" until it submits a bid b≥T, paying the sum of all its bids.

### An analysis of approximations for maximizing submodular set functions—I

• Mathematics
Math. Program.
• 1978
It is shown that a “greedy” heuristic always produces a solution whose value is at least 1 −[(K − 1/K]K times the optimal value, which can be achieved for eachK and has a limiting value of (e − 1)/e, where e is the base of the natural logarithm.

### Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

• Mathematics, Computer Science
JACM
• 1975
An algorithm is presented which finds for any 0 < e < 1 an approximate solution P satisfying (P* P)/P* < ~, where P* is the desired optimal sum.

### Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints

• Computer Science
ITCS '13
• 2013
This work addresses the fact that many problem instances may allow for a much better robustness guarantee than the pathological worst case instances, and presents an algorithm that constructs for each instance a solution with a robustness factor arbitrarily close to optimal.

### Approximate Submodularity and its Applications: Subset Selection, Sparse Approximation and Dictionary Selection

• Computer Science
J. Mach. Learn. Res.
• 2018
The submodularity ratio is introduced as a measure of how "close" to submodular a set function f is, and it is shown that when f has sub modularity ratio γ, the greedy algorithm for maximizing f provides a (1 - e-γ)-approximation.