Pages that link to "Item:Q1314524"
From MaRDI portal
The following pages link to Polynomial-time instances of the minimum weight triangulation problem (Q1314524):
Displaying 15 items.
- New results for the minimum weight triangulation problem (Q1343467) (← links)
- Counting triangulations and other crossing-free structures via onion layers (Q2351010) (← links)
- Minimum weight pseudo-triangulations (Q2385693) (← links)
- The minimum weight triangulation problem with few inner points (Q2495946) (← 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)
- Minimum-weight triangulation is NP-hard (Q3546362) (← links)
- Solving large-scale minimum-weight triangulation instances to provable optimality (Q5115812) (← links)
- Parameterized and Exact Computation (Q5311512) (← links)
- (Q5743438) (← links)
- A quasi-polynomial time approximation scheme for minimum weight triangulation (Q5891924) (← links)
- Minimum convex partition of a constrained point set (Q5929323) (← links)
- A lower bound for \(\beta\)-skeleton belonging to minimum weight triangulations (Q5943321) (← links)
- The drawability problem for minimum weight triangulations (Q5958308) (← links)
- A new subgraph of minimum weight triangulations (Q6487446) (← links)