Vojtěch Jarnik's work in combinatorial optimization

Bernhard Korte, J. N. (2001). Vojtěch Jarnik's work in combinatorial optimization.

Type

Unclassified

Intellectual base

Unclassified

Year

2001

DOI

10.1016/s0012-365x(00)00256-9

Link

https://doi.org/10.1016/s0012-365x(00)00256-9

Cited by

1 citation across 1 artifact.

Domain-specific

• Steiner tree problem
  • Graph, Euclidean, rectilinear and metric variants use different admissible carriers and complexity; unlike a minimum spanning tree, the optimum may introduce nonterminal junctions.

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:20c6309c25aa · see in the full table