A QPTAS for the base of the number of crossing-free structures on a planar point set (Q1698728)
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 6839810
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A QPTAS for the base of the number of crossing-free structures on a planar point set |
scientific article; zbMATH DE number 6839810 |
Statements
A QPTAS for the base of the number of crossing-free structures on a planar point set (English)
0 references
16 February 2018
0 references
computational geometry
0 references
approximation algorithms
0 references
counting triangulations
0 references
counting spanning trees
0 references
quasi-polynomial-time approximation scheme
0 references
0 references
0 references
0 references
0.9892272353172302
0 references
0.8394593596458435
0 references
0.8052366375923157
0 references
0.7978136539459229
0 references
0.7916221618652344
0 references
