Approximation Algorithms for Some Routing Problems

Frederickson, G. N., Hecht, M. S., & Kim, C. E. (1978). Approximation Algorithms for Some Routing Problems. SIAM Journal on Computing, 7(2), 178-193.

Type

Journal article

Intellectual base

Primary research

Year

1978

Volume

7

Issue

2

Pages

178-193

DOI

10.1137/0207017

DOI registrant

Society for Industrial & Applied Mathematics

Link

https://epubs.siam.org/doi/abs/10.1137/0207017

Cited by

1 citation across 1 artifact.

Domain-specific

• Stacker Crane Problem
  • Its name is historical, while its directed-service and connecting-travel structure is the reusable identity.

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.

Registry ID ref:81e3f13b0d0a · see in the full table