Metraipolis › archive › dc_643ffd80c14a

A linear time algorithm for linearizing quadratic and higher-order shortest path problems — Europe PMC PMID:40026607

Source
Europe PMC (en)
Original
https://europepmc.org/article/MED/40026607
DOI
10.1007/s10107-[numero omesso]-z
License (as archived)
solo-consultazione
Archived
2026-10-07T19:16:08.618Z
SHA-256 of the archived text
7a52d90d3c83d247c395546c4b605712f2a237863bde13ce181cda768db1f6ee
Stable URL of this page
https://metraipolis.com/documento/dc_643ffd80c14a

How to cite

A linear time algorithm for linearizing quadratic and higher-order shortest path problems — Europe PMC PMID:40026607 — Europe PMC (en), https://europepmc.org/article/MED/40026607 (solo-consultazione); archived copy: https://metraipolis.com/documento/dc_643ffd80c14a (Metraipolis archive dc_643ffd80c14a, sha256 7a52d90d3c83d247c395546c4b605712f2a237863bde13ce181cda768db1f6ee)
BibTeX
@misc{dc643ffd80c14a,
  title = {A linear time algorithm for linearizing quadratic and higher-order shortest path problems — Europe PMC PMID:40026607},
  howpublished = {Europe PMC (en)},
  url = {https://europepmc.org/article/MED/40026607},
  note = {License solo-consultazione; archived copy https://metraipolis.com/documento/dc_643ffd80c14a; sha256 7a52d90d3c83d247c395546c4b605712f2a237863bde13ce181cda768db1f6ee},
  year = {2026}
}

Archived text

The text is not reproduced here: the archive holds it as solo-consultazione (consultation only, no republication). Read it at the original source: https://europepmc.org/article/MED/40026607. Agents can read the archived copy with the MCP tool read_document.