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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.comgeo.2005.11.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030923360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3278735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for determining the convex hull of a finite planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Triangulations of Polygonal Domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximation behavior of the greedy triangulation for convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight triangulation and graph drawing / rank
 
Normal rank

Latest revision as of 13:20, 24 June 2024

scientific article
Language Label Description Also known as
English
Progress on maximum weight triangulation
scientific article

    Statements

    Progress on maximum weight triangulation (English)
    0 references
    0 references
    0 references
    28 April 2006
    0 references
    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
    0 references
    0 references
    constant approximation
    0 references
    algorithm
    0 references
    polynomial-time 4.238-approximation
    0 references
    0 references