Minimum-Weight Triangulation is NP-hard¶
Mulzer, W., & Rote, G. (2008). Minimum-Weight Triangulation is NP-hard. Journal of the ACM.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Minimum-weight triangulation
- The optimum can have more than one realization.
This sourceFull original author text inspected. Relevant locators: §1 definition and Figure 1, §4.2 Proposition 4.2 and Appendix B.2 for polygon dynamic programming and arithmetic-model qualification, §8 Theorem 8.1 for strong point-set NP-hardness, and §9.3 for the Euclidean NP-membership and approximation limits.
- The optimum can have more than one realization.
Verification¶
Does it exist? Not checked yet. This work's DOI is recorded above but has not been resolved against an external catalogue, so nothing here confirms the work exists.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Links previously used in the corpus¶
Before the registry existed this work was also linked 1 other way.
Registry ID ref:3ecbfaac8a53 · see in the full table