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 6 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)
- An almost four-approximation algorithm for maximum weight triangulation (Q2268761) (← links)
- Approximation schemes for node-weighted geometric Steiner tree problems (Q2391178) (← links)
- A new asymmetric inclusion region for minimum weight triangulation (Q2655340) (← links)
