Approximating Maximum Diameter-Bounded Subgraphs
From MaRDI portal
Publication:3557054
DOI10.1007/978-3-642-12200-2_53zbMath1283.05254MaRDI QIDQ3557054
Yuichi Asahiro, Kazuaki Samizo, Eiji Miyano
Publication date: 27 April 2010
Published in: LATIN 2010: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12200-2_53
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
Unnamed Item, Finding clubs in graph classes, On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs, Finding large \(k\)-clubs in undirected graphs, Optimal approximation algorithms for maximum distance-bounded subgraph problems, Parameterized computational complexity of finding small-diameter subgraphs, On structural parameterizations for the 2-club problem, The maximum degree \& diameter-bounded subgraph and its applications, Distance-Based Clique Relaxations in Networks: s-Clique and s-Club, On the 2-Club Polytope of Graphs, Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems