A Linear-Time Approximation Scheme for Maximum Weight Triangulation of Convex Polygons

ISSN： 0178-4617

Source： Algorithmica, Vol.40, Iss.3, 2004-08, pp. : 161-172

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs

By Hong Seok-Hee Nagamochi Hiroshi

Algorithmica, Vol. 58, Iss. 2, 2010-10 ,pp. : 433-460

Springer Publishing Company

Access to resources Recommend Favorite

Smooth Convex Approximation to the Maximum Eigenvalue Function

By Chen Xin Qi Houduo Qi Liqun Teo Kok-Lay

Journal of Global Optimization, Vol. 30, Iss. 2-3, 2004-11 ,pp. : 253-270

Springer Publishing Company

Access to resources Recommend Favorite

Extremal problems for convex polygons

By Audet Charles Hansen Pierre Messine Frédéric

Journal of Global Optimization, Vol. 38, Iss. 2, 2007-06 ,pp. : 163-179

Springer Publishing Company

Access to resources Recommend Favorite

Linear-Time Self-Interpretation of the Pure Lambda Calculus

By Mogensen T.Æ.

LISP and Symbolic Computation, Vol. 13, Iss. 3, 2000-09 ,pp. : 217-237

Springer Publishing Company

Access to resources Recommend Favorite

Linear-Time Construction of Two-Dimensional Suffix Trees

By Kim Dong Na Joong Sim Jeong Park Kunsoo

Algorithmica, Vol. 59, Iss. 2, 2011-02 ,pp. : 269-297

Springer Publishing Company

Access to resources Recommend Favorite