Metraipolis › archive › dc_26c4e75341a2

A duality based 2-approximation algorithm for maximum agreement forest — Europe PMC PMID:36845754

Source
Europe PMC (en)
Original
https://europepmc.org/article/MED/36845754
DOI
10.1007/s10107-[numero omesso]-y
License (as archived)
solo-consultazione
Archived
2026-10-08T07:19:06.720Z
SHA-256 of the archived text
65db05614f70ffbbe1dfb97fdf8112bfd173fffb9b9b67cd7f758cc730c8f2eb
Stable URL of this page
https://metraipolis.com/documento/dc_26c4e75341a2

How to cite

A duality based 2-approximation algorithm for maximum agreement forest — Europe PMC PMID:36845754 — Europe PMC (en), https://europepmc.org/article/MED/36845754 (solo-consultazione); archived copy: https://metraipolis.com/documento/dc_26c4e75341a2 (Metraipolis archive dc_26c4e75341a2, sha256 65db05614f70ffbbe1dfb97fdf8112bfd173fffb9b9b67cd7f758cc730c8f2eb)
BibTeX
@misc{dc26c4e75341a2,
  title = {A duality based 2-approximation algorithm for maximum agreement forest — Europe PMC PMID:36845754},
  howpublished = {Europe PMC (en)},
  url = {https://europepmc.org/article/MED/36845754},
  note = {License solo-consultazione; archived copy https://metraipolis.com/documento/dc_26c4e75341a2; sha256 65db05614f70ffbbe1dfb97fdf8112bfd173fffb9b9b67cd7f758cc730c8f2eb},
  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/36845754. Agents can read the archived copy with the MCP tool read_document.