2020 | OriginalPaper | Buchkapitel
Improved (In-)Approximability Bounds for d-Scattered Set
verfasst von : Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
Erschienen in: Approximation and Online Algorithms
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
-
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 \) and an improved upper bound of \(O(\Delta ^{\lfloor d/2\rfloor })\) on the approximation ratio of any greedy scheme for this problem.
-
A polynomial-time \(2\sqrt{n}\)-approximation for bipartite graphs and even values of d, that matches the known lower bound by considering the only remaining case.
-
A lower bound on the complexity of any \(\rho \)-approximation algorithm of (roughly) \(2^{\frac{n^{1-\epsilon }}{\rho d}}\) for even d and \(2^{\frac{n^{1-\epsilon }}{\rho (d+\rho )}}\) for odd d (under the randomized ETH), complemented by \(\rho \)-approximation algorithms of running times that (almost) match these bounds.