Pages that link to "Item:Q5311512"
From MaRDI portal
The following pages link to Parameterized and Exact Computation (Q5311512):
Displaying 9 items.
- Polynomial-time instances of the minimum weight triangulation problem (Q1314524) (← links)
- The minimum weight triangulation problem with few inner points (Q2495946) (← links)
- The traveling salesman problem with few inner points (Q2583717) (← 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)
- Minimum weight disk triangulations and fillings (Q5857742) (← links)
- Algorithms and Computation (Q5897930) (← links)
- The drawability problem for minimum weight triangulations (Q5958308) (← links)