Jan 25, 2020 · We study the problem's (in-)approximability and offer improvements and extensions of known results for Independent Set, of which the problem is ...

May 1, 2023 · We study the problem's (in-)approximability and offer improvements and extensions of known results for I N D E P E N D E N T S E T , of which it ...

Abstract. In the d-Scattered Set problem we are asked to select at least k vertices of a given graph, so that the distance between any pair is at least d.

Oct 12, 2019 · This paper aims to advance our understanding in this direction by providing the first lower bound on the approximation ratio of any polynomial- ...

In the -Scattered Set problem we are asked to select at least k vertices of a given graph, so that the distance between any pair is at least d.

A lower bound of $\Delta^{\lfloor d/2\rfloor-\epsilon}$ on the approximation ratio of any polynomial-time algorithm for graphs of maximum degree $\Delta$ ...

In the \(d\)-Scattered Set problem we are asked to select at least k vertices of a given graph, so that the distance between any pair is at least d.

In the $d$-Scattered Set problem we are asked to select at least $k$ vertices of a given graph, so that the distance between any pair is at least $d$.

Improved (In-)Approximability Bounds for d-Scattered Set. https://doi.org/10.1007/978-3-030-39479-0_14 ·. Journal: Approximation and Online Algorithms Lecture ...