Pages that link to "Item:Q5899509"
From MaRDI portal
The following pages link to A quasi-polynomial time approximation scheme for minimum weight triangulation (Q5899509):
Displaying 12 items.
- Quadtree, ray shooting and approximate minimum weight Steiner triangulation (Q1862115) (← links)
- A note on a QPTAS for maximum weight triangulation of planar point sets (Q2448113) (← links)
- Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand (Q2806071) (← links)
- Finding a maximum weight triangle in n <sup>3-Δ</sup> time, with applications (Q2931387) (← links)
- Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound (Q2958326) (← links)
- (Q4252378) (← links)
- (Q4500844) (← links)
- (Q4875212) (← links)
- Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376) (Q5470799) (← links)
- (Q5743438) (← links)
- A quasi-polynomial time approximation scheme for minimum weight triangulation (Q5891924) (← links)
- Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings (Q6634523) (← links)