Cargando…
New Tools and Connections for Exponential-Time Approximation
In this paper, we develop new tools and connections for exponential time approximation. In this setting, we are given a problem instance and an integer [Formula: see text] , and the goal is to design an approximation algorithm with the fastest possible running time. We give randomized algorithms tha...
Autores principales: | Bansal, Nikhil, Chalermsook, Parinya, Laekhanukit, Bundit, Nanongkai, Danupon, Nederlof, Jesper |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6710224/ https://www.ncbi.nlm.nih.gov/pubmed/31496549 http://dx.doi.org/10.1007/s00453-018-0512-8 |
Ejemplares similares
-
Equivalence classes and conditional hardness in massively parallel computations
por: Nanongkai, Danupon, et al.
Publicado: (2022) -
Kullback–Leibler divergence and the Pareto–Exponential approximation
por: Weinberg, G. V.
Publicado: (2016) -
Limit theorems of polynomial approximation with exponential weights
por: Ganzburg, Michael I
Publicado: (2008) -
H-matrix approximation for the operator exponential with applications
por: Gavrilyuk, I P, et al.
Publicado: (2000) -
Exponential node clustering at singularities for rational approximation, quadrature, and PDEs
por: Trefethen, Lloyd N., et al.
Publicado: (2021)