Approximating Maximum Diameter-Bounded Subgraphs

DOI10.1007/978-3-642-12200-2_53zbMath1283.05254OpenAlexW1498923031MaRDI 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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items

Optimal approximation algorithms for maximum distance-bounded subgraph problems ⋮ On Fault-Tolerant Low-Diameter Clusters in Graphs ⋮ Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems ⋮ The maximum degree \& diameter-bounded subgraph and its applications ⋮ Approximating maximum diameter-bounded subgraph in unit disk graphs ⋮ Finding clubs in graph classes ⋮ On the 2-Club Polytope of Graphs ⋮ On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs ⋮ Finding large \(k\)-clubs in undirected graphs ⋮ Parameterized computational complexity of finding small-diameter subgraphs ⋮ Distance-Based Clique Relaxations in Networks: s-Clique and s-Club ⋮ Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs ⋮ On structural parameterizations for the 2-club problem ⋮ Algorithms and complexity of \(s\)-club cluster vertex deletion

This page was built for publication: Approximating Maximum Diameter-Bounded Subgraphs