Approximating maximum diameter-bounded subgraph in unit disk graphs
From MaRDI portal
Publication:2665266
DOI10.1007/s00454-021-00327-yOpenAlexW3196388400MaRDI QIDQ2665266
Anil Maheshwari, Pat Morin, A. Karim Abu-Affash, Paz Carmi, Shakhar Smorodinsky, Michiel H. M. Smid
Publication date: 18 November 2021
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/8715/
VC-dimensionapproximation algorithmsfractional Helly theoremunit disk graphsmaximum diameter-bounded subgraph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
- Finding large \(k\)-clubs in undirected graphs
- Upper bounds and heuristics for the 2-club problem
- Covering planar graphs with a fixed number of balls
- On the maximum number of edges in topological graphs with no four pairwise crossing edges
- Unit disk graphs
- Quasi-planar graphs have a linear number of edges
- On coloring unit disk graphs
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- Optimal approximation algorithms for maximum distance-bounded subgraph problems
- Bounded VC-dimension implies a fractional Helly theorem
- On clique relaxation models in network analysis
- Efficient sub-5 approximations for minimum dominating sets in unit disk graphs
- Novel approaches for analyzing biological networks
- Approximating 2-cliques in unit disk graphs
- Approximating Maximum Diameter-Bounded Subgraphs
- A graph‐theoretic definition of a sociometric clique†
- Integer models and upper bounds for the 3‐club problem
This page was built for publication: Approximating maximum diameter-bounded subgraph in unit disk graphs
