• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

Time-Approximation Trade-offs for Inapproximable Problems

Bonnet, Édouard; Lampis, Michael; Paschos, Vangelis (2016), Time-Approximation Trade-offs for Inapproximable Problems, in Ollinger, Nicolas; Vollmer, Heribert, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik : Wadern, p. 22:1-22:14. 10.4230/LIPIcs.STACS.2016.22

Type
Communication / Conférence
Date
2016
Conference title
33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)
Conference date
2016-02
Conference city
Orléans
Conference country
France
Book title
33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)
Book author
Ollinger, Nicolas; Vollmer, Heribert
Publisher
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Published in
Wadern
ISBN
978-3-95977-001-9
Number of pages
798
Pages
22:1-22:14
Publication identifier
10.4230/LIPIcs.STACS.2016.22
Metadata
Show full item record
Author(s)
Bonnet, Édouard cc
Institute for Computer Science and Control [Budapest] [SZTAKI]
Lampis, Michael cc
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Paschos, Vangelis
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
In this paper we focus on problems which do not admit a constant-factor approximation 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 r(n), a simple, known scheme gives an approximation ratio of r in time roughly r^{n/r}. We show that, for most values of r, if this running time could be significantly improved the ETH would fail. For MAX MINIMAL VERTEX COVER we give a non-trivial sqrt{r}-approximation in time 2^{n/{r}}. We match this with a similarly tight result. We also give a log(r)-approximation for MIN ATSP in time 2^{n/r} and an r-approximation for MAX GRUNDY COLORING in time r^{n/r}. Furthermore, we show that MIN SET COVER exhibits a curious behavior in this super-polynomial setting: for any delta>0 it admits an m^delta-approximation, where m is the number of sets, in just quasi-polynomial time. We observe that if such ratios could be achieved in polynomial time, the ETH or the Projection Games Conjecture would fail.
Subjects / Keywords
Approximation; Complexity; Polynomial and Subexponential Approximation; Reduction; Inapproximability

Related items

Showing items related by title and author.

  • Thumbnail
    Time-approximation trade-offs for inapproximable problems 
    Bonnet, Édouard; Lampis, Michael; Paschos, Vangelis (2018) Article accepté pour publication ou publié
  • Thumbnail
    Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems 
    Bonnet, Édouard; Paschos, Vangelis; Sikora, Florian (2016) Article accepté pour publication ou publié
  • Thumbnail
    Purely combinatorial approximation algorithms for maximum k -vertex cover in bipartite graphs 
    Bonnet, Edouard; Escoffier, Bruno; Paschos, Vangelis; Stamoulis, Georgios (2018) Article accepté pour publication ou publié
  • Thumbnail
    Structural parameters, tight bounds, and approximation for (k,r)-center 
    Katsikarelis, Ioannis; Lampis, Michael; Paschos, Vangelis (2019) Article accepté pour publication ou publié
  • Thumbnail
    Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse 
    Fotakis, Dimitris; Lampis, Michael; Paschos, Vangelis (2016) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo