Linear-Time Algorithms for Linear Programming in R3 and Related Problems

Nimrod Megiddo, '. A. f. L. P. i. R., & Related Problems, '. S. J. o. C. 1. (1983). Linear-Time Algorithms for Linear Programming in R3 and Related Problems.

Type

Unclassified

Intellectual base

Unclassified

Year

1983

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Prune and search
  • … optimization problem, candidate set, pruning test, proof that an optimum survives, guaranteed reduction fraction, pruning cost, base case and resulting recurrence and complexity are explicit. to An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:90aa3a39e0ce · see in the full table