Hardness of Approximation of (Multi-)LCS over Small Alphabet
Jiang and Li [SICOMP'95] showed that if Max-Clique is hard to approximate within a factor of s then Multi-LCS is also hard to approximate within a factor of \Theta(s).
Jun 24, 2020
In this paper, we make a significant progress towards proving hardness of approximation over small alphabet by showing a polynomial-time reduction from the well ...
A significant progress is made towards proving hardness of approximation over small alphabet by showing a polynomial-time reduction from the well-studied ...
In this paper, we make a significant progress towards proving hardness of approximation over small alphabet by showing a polynomial-time reduction from the well ...
Jun 24, 2020 · In this paper, we make a significant progress towards proving hardness of approximation over small alphabet by showing a polynomial-time ...
In this paper, we make a significant progress towards proving hardness of approximation over small alphabet by showing a polynomial-time reduction from the well ...
Amey Bhangale, Diptarka Chakraborty, Rajendra Kumar: Hardness of Approximation of (Multi-)LCS over Small Alphabet. APPROX-RANDOM 2020: 38:1-38:16.
Duration: 20:59
Posted: Aug 13, 2020
Posted: Aug 13, 2020
Hardness of Approximation of (Multi-)LCS over Small Alphabet. Amey Bhangale Diptarka Chakraborty Rajendra Kumar. Published in: APPROX-RANDOM (2020).
Co-authors ; Hardness of Approximation of (Multi-) LCS over Small Alphabet. A Bhangale, D Chakraborty, R Kumar. arXiv preprint arXiv:2006.13449, 2020. 1, 2020.