Construct · 1 fields · 1 citations

instance optimality: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
instanceoptimality1 CONSTRUCTInstance optimalityFAGIN · ANALYSIS OF ALGORITHMS

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Analysis of algorithms

the property of an algorithm being within a constant factor of the best possible algorithm on every single input, not only in the worst case.

In analysis of algorithms, instance optimality refers to the property of an algorithm being within a constant factor of the best possible algorithm on every single input, not only in the worst case. This meaning comes from Fagin (2003) in Journal of Computer and System Sciences.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how instance optimality sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

Fagin's threshold algorithm1 fields · 1 citationsanchor · a standalone constructbeing3 fields · 3 citationsjingle · one word, three constructscase2 fields · 3 citationsjingle · one word, two constructs

References

  1. Fagin, R., Lotem, A., & Naor, M. (2003). Optimal aggregation algorithms for middleware. Journal of Computer and System Sciences, 66(4), 614-656. https://doi.org/10.1016/s0022-0000(03)00026-6

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct