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 r > 1 , and the goal is to design an approximation algorithm with the fastest possible running time. We give randomized algorithms that establis...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 81; H. 10; S. 3993 - 4009
Hauptverfasser:	Bansal, Nikhil, Chalermsook, Parinya, Laekhanukit, Bundit, Nanongkai, Danupon, Nederlof, Jesper
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.10.2019 Springer Nature B.V
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Approximation Approximation algorithms Combinatorial analysis Complexity Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Decision trees Exponential time algorithms Lower bounds Mathematical analysis Mathematics of Computing PCP's Polynomials Randomization Run time (computers) Special Issue: Parameterized and Exact Computation Theory of Computation Approximation algorithms PCP’s Exponential time algorithms
ISSN:	0178-4617, 1432-0541, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!