Inapproximability of Maximum Biclique Problems, Minimum k-Cut and Densest At-Least-k-Subgraph from the Small Set Expansion Hypothesis †

Author： Manurangsi Pasin  

Publisher： MDPI

E-ISSN： 1999-4893|11|1|10-10

ISSN： 1999-4893

Source： Algorithms, Vol.11, Iss.1, 2018-01, pp. : 10-10

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree

By Akutsu Tatsuya   Tamura Takeyuki  

Algorithms, Vol. 6, Iss. 1, 2013-02 ,pp. : 119-135

MDPI

Access to resources Recommend Favorite

Efficient Algorithms for the Maximum Sum Problems

By Bae Sung Eun   Shinn Tong-Wook   Takaoka Tadao  

Algorithms, Vol. 10, Iss. 1, 2017-01 ,pp. : 5-5

MDPI

Access to resources Recommend Favorite

Pattern-Guided k-Anonymity

By Bredereck Robert   Nichterlein André   Niedermeier Rolf  

Algorithms, Vol. 6, Iss. 4, 2013-10 ,pp. : 678-701

MDPI

Access to resources Recommend Favorite

Problems on Finite Automata and the Exponential Time Hypothesis

By Fernau Henning   Krebs Andreas  

Algorithms, Vol. 10, Iss. 1, 2017-02 ,pp. : 24-24

MDPI

Access to resources Recommend Favorite

Efficient Algorithms for Subgraph Listing

By Zechner Niklas   Lingas Andrzej  

Algorithms, Vol. 7, Iss. 2, 2014-05 ,pp. : 243-252

MDPI

Access to resources Recommend Favorite