Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Link opens in a new tab
Search content at Illinois Experts
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Approximation algorithms for maximum cliques in 3D unit-disk graphs
Peyman Afshani
,
Timothy M. Chan
Research output
:
Contribution to conference
›
Paper
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Approximation algorithms for maximum cliques in 3D unit-disk graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
In(III)
100%
Approximation Algorithms
100%
Polynomial-time Algorithm
100%
Maximum Clique
100%
K-points
100%
Polynomial-time Approximation Scheme
100%
Largest Subset
100%
Approximation Factor
100%
Constant Approximation
100%
Minimum Diameter
100%
Unit Disk Graph
100%
Third Space
100%
Mathematics
Polynomial Time
100%
Clique
100%
Unit Disk
100%
Set Point
50%