Time-approximation trade-offs for inapproximable problems - Université Claude Bernard Lyon 1 Accéder directement au contenu
Article Dans Une Revue Journal of Computer and System Sciences Année : 2018

Time-approximation trade-offs for inapproximable problems

Résumé

In this paper we focus on problems inapproximable in polynomial time and explore how quickly their approximability improves as the allowed running time is gradually increased from polynomial to (sub-)exponential. We tackle a number of problems: For Min Independent Dominating Set, Max Induced Path, Forest and Tree, for any , a simple, known scheme gives an approximation ratio of r in time roughly . We show that, if this running time could be significantly improved, the ETH would fail. For Max Minimal Vertex Cover we give a -approximation in time . We match this with a similarly tight result. We also give a -approximation for Min ATSP in time and an r-approximation for Max Grundy Coloring in time . Finally, we investigate the approximability of Min Set Cover, when measuring the running time as a function of the number of sets in the input.

Dates et versions

hal-02170681 , version 1 (02-07-2019)

Identifiants

Citer

Édouard Bonnet, Michael Lampis, Vangelis Th. Paschos. Time-approximation trade-offs for inapproximable problems. Journal of Computer and System Sciences, 2018, 92, pp.171-180. ⟨10.1016/j.jcss.2017.09.009⟩. ⟨hal-02170681⟩
65 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More