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...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 81; no. 10; pp. 3993 - 4009
Main Authors:	Bansal, Nikhil, Chalermsook, Parinya, Laekhanukit, Bundit, Nanongkai, Danupon, Nederlof, Jesper
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.10.2019 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!