Semi-Exact Exponential-Time Algorithms: an Experimental Study

The last decade witnessed an increased interest in exact and parameterized exponential-time algorithms for NP - hard problems. The hardness of polynomial-time approximation of many intractable problems motivated the work on fixed-parameter approximation where polynomial-time is relaxed into FPT -tim...

Full description

Bibliographic Details

Published in:	2020 Second International Conference on Transdisciplinary AI (TransAI) pp. 96 - 99
Main Authors:	El-Wahab, Mohamed Mahmoud Abd, Abu-Khzam, Faisal N., Wang, Kai, Shaw, Peter
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.09.2020
Subjects:	Dominating Set Semi-exact algorithms Vertex Cover
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!