Progress on maximum weight triangulation (Q2489534): Difference between revisions

Instead of the very hard minimum weight triangulation problem, the authors study the maximum weight triangulation and obtain a polynomial-time 4.238-approximation for the problem.

0 references

reviewed by

Ding-Zhu Du

0 references

Mathematics Subject Classification ID

0 references

0 references

constant approximation

0 references

algorithm

0 references

polynomial-time 4.238-approximation

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.comgeo.2005.11.001

0 references

0 references

0 references

0 references

An efficient algorithm for determining the convex hull of a finite planar set

0 references

Minimal Triangulations of Polygonal Domains

0 references

On approximation behavior of the greedy triangulation for convex polygons

0 references

Q4875212

0 references

Maximum weight triangulation and graph drawing

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2489534

@@ Property / cites work @@
+Q4953817
@@ Property / cites work: Q4953817 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3278735
@@ Property / cites work: Q3278735 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for determining the convex hull of a finite planar set
+Normal rank
@@ Property / cites work @@
+Minimal Triangulations of Polygonal Domains
@@ Property / cites work: Minimal Triangulations of Polygonal Domains / rank @@
+Normal rank
@@ Property / cites work @@
+On approximation behavior of the greedy triangulation for convex polygons
+Normal rank
@@ Property / cites work @@
+Q4875212
@@ Property / cites work: Q4875212 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum weight triangulation and graph drawing
@@ Property / cites work: Maximum weight triangulation and graph drawing / rank @@
+Normal rank