An almost four-approximation algorithm for maximum weight triangulation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 871937 (Why is no real title available?)
- scientific article; zbMATH DE number 1446325 (Why is no real title available?)
- A New Heuristic for Minimum Weight Triangulation
- A heuristic triangulation algorithm
- A linear-time approximation scheme for maximum weight triangulation of convex polygons
- A linear-time approximation scheme for minimum weight triangulation of convex polygons
- A quasi-polynomial time approximation scheme for minimum weight triangulation
- Computing and Combinatorics
- Maximum weight triangulation and graph drawing
- Minimum weight triangulation is NP-hard
- New results for the minimum weight triangulation problem
- Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation
Cited in
(3)
This page was built for publication: An almost four-approximation algorithm for maximum weight triangulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268761)