Spring til hovednavigation
Spring til søgning
Spring til hovedindhold
Københavns Universitets forskningsportal Forside
Hjælp og OSS
Dansk
English
Forside
Profiler
Publikation
Forskningsenheder
Presse/medier
Aktiviteter
Priser
???studenttheses???
Forskningsdatasæt
Søg efter ekspertise, navn eller tilknytning
Approximation schemes for independent set and sparse subsets of polygons
Anna Adamaszek, Sariel Har-Peled, Andreas Wiese
*
*
Corresponding author af dette arbejde
Datalogisk Institut
4
Citationer (Scopus)
Oversigt
Fingeraftryk
Fingeraftryk
Dyk ned i forskningsemnerne om 'Approximation schemes for independent set and sparse subsets of polygons'. Sammen danner de et unikt fingeraftryk.
Sorter
Vægt
Alfabetisk
Computer Science
Independent Set
100%
approximation scheme
100%
Intersection Graph
66%
Polynomial Time
33%
Cardinality
33%
Sparsity
33%
Approximation Algorithm
33%
Approximation Ratio
33%
Approximation (Algorithm)
33%
Polynomial Time Algorithm
33%
Mathematics
Independent Set
100%
Polygon
100%
Polynomial Time
33%
Intersection Graph
33%
Edge
33%
Running Time
16%
Intersect
16%
Polynomial
16%
Bounding Box
16%
Recursive Partitioning
16%
Approximates
16%
Total Weight
16%
Cardinality
16%
Keyphrases
Intersection Graph
33%
Sparsity Conditions
16%
Bounding Box
16%
Balanced Cut
16%
Input Elements
16%