A Quasi-Polynomial Time Approximation Scheme for Minimum Weight Triangulation

Remy, J., & Steger, A. (2009). A Quasi-Polynomial Time Approximation Scheme for Minimum Weight Triangulation. Journal of the ACM.

Type

Journal article

Intellectual base

Primary research

Year

2009

DOI

10.1145/1516512.1516517

DOI registrant

Association for Computing Machinery

Link

https://doi.org/10.1145/1516512.1516517

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 sourceThis entry uses only the stated QPTAS and (1+ε) guarantee, not proof details or a damaged exact runtime exponent.

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.

• https://paperity.org/p/376815513/a-quasi-polynomial-time-approximation-scheme-for-minimum-weight-triangulation ×1

Registry ID ref:c8c36eea602e · see in the full table