The minimum weight triangulation problem with few inner points
From MaRDI portal
Recommendations
- The minimum weight triangulation problem with few inner points
- A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators
- Polynomial-time instances of the minimum weight triangulation problem
- A quasi-polynomial time approximation scheme for minimum weight triangulation
- New results for the minimum weight triangulation problem
Cited in
(12)- Polynomial-time instances of the minimum weight triangulation problem
- The minimum weight triangulation problem with few inner points
- The traveling salesman problem with few inner points
- Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound
- FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM
- A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators
- Minimum-weight triangulation is NP-hard
- Minimum weight triangulation is NP-hard
- Solving large-scale minimum-weight triangulation instances to provable optimality
- Minimum weight disk triangulations and fillings
- Algorithms and Computation
- The drawability problem for minimum weight triangulations
This page was built for publication: The minimum weight triangulation problem with few inner points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311512)