Use of cookies

Lund University uses cookies to ensure that the website functions properly and to improve your experience.

Read more in our cookie policy

Search results

Filter

Reset filter

Filetype

Your search for "2026" yielded 28240 hits

Sensitivity Lower Bounds for Approximation Algorithms

Sensitivity measures how much the output of an algorithm changes, in terms of Hamming distance, when part of the input is modified. While approximation algorithms with low sensitivity have been developed for many problems, no sensitivity lower bounds were previously known for approximation algorithms. In this work, we establish the first polynomial lower bound on the sensitivity of (randomized) ap