Instance specific approximations for submodular maximization
E Balkanski, S Qian, Y Singer - International Conference on …, 2021 - proceedings.mlr.press
The predominant measure for the performance of an algorithm is its worst-case
approximation guarantee. While worst-case approximations give desirable robustness …
approximation guarantee. While worst-case approximations give desirable robustness …
Bilu-linial stability, certified algorithms and the independent set problem
We study the Maximum Independent Set (MIS) problem under the notion of stability
introduced by Bilu and Linial (2010): a weighted instance of MIS is $\gamma $-stable if it has …
introduced by Bilu and Linial (2010): a weighted instance of MIS is $\gamma $-stable if it has …
On the unreasonable effectiveness of the greedy algorithm: Greedy adapts to sharpness
It is well known that the standard greedy algorithm guarantees a worst-case approximation
factor of $1-1/e $ when maximizing a monotone submodular function under a cardinality …
factor of $1-1/e $ when maximizing a monotone submodular function under a cardinality …
A new approximation guarantee for monotone submodular function maximization via discrete convexity
In monotone submodular function maximization, approximation guarantees based on the
curvature of the objective function have been extensively studied in the literature. However …
curvature of the objective function have been extensively studied in the literature. However …
The Power of Greedy for Online Minimum Cost Matching on the Line
In the online minimum cost matching problem, there are n servers and, at each of n time
steps, a request arrives and must be irrevocably matched to a server that has not yet been …
steps, a request arrives and must be irrevocably matched to a server that has not yet been …
Budget-smoothed analysis for submodular maximization
A Rubinstein, J Zhao - arxiv preprint arxiv:2102.05782, 2021 - arxiv.org
The greedy algorithm for monotone submodular function maximization subject to cardinality
constraint is guaranteed to approximate the optimal solution to within a $1-1/e $ factor …
constraint is guaranteed to approximate the optimal solution to within a $1-1/e $ factor …
[LIBRO][B] Hierarchical clustering with global objectives: Approximation algorithms and hardness results
E Chatziafratis - 2020 - search.proquest.com
Hierarchical Clustering is an important tool for data analysis, used in diverse areas ranging
from Phylogenetics in Biology to YouTube video recommendations and everything in …
from Phylogenetics in Biology to YouTube video recommendations and everything in …
Dual-mode greedy algorithms can save energy
In real world applications, important resources like energy are saved by deliberately using
so-called low-cost operations that are less reliable. Some of these approaches are based on …
so-called low-cost operations that are less reliable. Some of these approaches are based on …
Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry
Finding a minimum vertex cover in a network is a fundamental NP-complete graph problem.
One way to deal with its computational hardness, is to trade the qualitative performance of …
One way to deal with its computational hardness, is to trade the qualitative performance of …
New Separations and Beyond-Worst-Case Analysis in Algorithmic Game Theory and Submodular Optimization
J Zhao - 2024 - search.proquest.com
In algorithmic game theory, we analyze games and design mechanisms through
computational lens. We prefer mechanisms that are simple, deterministic and incentive …
computational lens. We prefer mechanisms that are simple, deterministic and incentive …