Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems
Sign Up to like & getrecommendations! Published in 2017 at "Algorithmica"
DOI: 10.1007/s00453-017-0344-y
Abstract: In this paper we study the (in)approximability of two distance-based relaxed variants of the maximum clique problem (Max Clique), named Maxd-Clique and Maxd-Club: A d-clique in a graph $$G = (V, E)$$G=(V,E) is a subset… read more here.
Keywords: club; max clique; clique; varepsilon ... See more keywords