Assertion: minimum weight triangulation | /r/HasProperty | constructed in subexponential time
Facets:
value: by a dynamic programming algorithm
type: OTHER
value: np-hard
type: MANNER
Source sentences:
text: Although NP-hard, the minimum weight triangulation may be constructed in subexponential time by a dynamic programming algorithm that considers all possible simple cycle separators of O ( n ) {