← Search

Alberto Marchetti-Spaccamela

2 accepted papers

2022

A Universal Error Measure for Input Predictions Applied to Online Graph Problems

NeurIPS 2022accept

We introduce a novel measure for quantifying the error in input predictions. The error is based on a minimum-cost hyperedge cover in a suitably defined hypergraph and provides a general template which we apply to online graph problems. The measure captures errors due to absent predicted requests as…

Cited by 18SourcePDFScholar
2021

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity

ICML 2021spotlight

The growing need to deal with massive instances motivates the design of algorithms balancing the quality of the solution with applicability. For the latter, an important measure is the \emph{adaptive complexity}, capturing the number of sequential rounds of parallel computation needed. In this work…

Cited by 18SourcePDFScholar