Pages that link to "Item:Q5891924"
From MaRDI portal
The following pages link to A quasi-polynomial time approximation scheme for minimum weight triangulation (Q5891924):
Displaying 18 items.
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing (Q494936) (← links)
- Minimum weight convex Steiner partitions (Q548652) (← links)
- A linear time algorithm for max-min length triangulation of a convex polygon (Q845931) (← links)
- Polynomial-time instances of the minimum weight triangulation problem (Q1314524) (← links)
- Quadtree, ray shooting and approximate minimum weight Steiner triangulation (Q1862115) (← links)
- An almost four-approximation algorithm for maximum weight triangulation (Q2268761) (← links)
- Approximation schemes for node-weighted geometric Steiner tree problems (Q2391178) (← links)
- A note on a QPTAS for maximum weight triangulation of planar point sets (Q2448113) (← links)
- The minimum weight triangulation problem with few inner points (Q2495946) (← links)
- A new asymmetric inclusion region for minimum weight triangulation (Q2655340) (← 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)
- Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation (Q4216140) (← links)
- (Q4252378) (← links)
- (Q4500844) (← links)
- (Q4875212) (← links)
- Parameterized and Exact Computation (Q5311512) (← links)
- Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376) (Q5470799) (← links)