A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs (Q3387760)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7294223
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs |
scientific article; zbMATH DE number 7294223 |
Statements
A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (English)
0 references
13 January 2021
0 references
unit disk graph
0 references
separator
0 references
fat objects
0 references
subexponential
0 references
ETH
0 references
0 references
0 references
0 references
0 references
0 references
0.971095621585846
0 references
0.7413638234138489
0 references
0.7330454587936401
0 references
0.7274367213249207
0 references
