Erratum

DOI10.1002/1097-0037(199603)27:2%3C169::AID-NET3230270203%3E3.0.CO;2-BMaRDI QIDQ4887746zbMATH OpenOpenAlexFDO

Authors Bezalel Gavish, Seshadri Sridhar

Publication date 4 August 1997

Full work available at URL https://doi.org/10.1002/1097-0037(199603)27:2%3C169::aid-net3230270203%3E3.0.co;2-b

zbMATH Keywords

tree networks2-median

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Cited in

(3)

• Computing the 2‐median on tree networks in O(n lg n) time
• Efficient computation of 2-medians in a tree network with positive/negative weights
• Erratum to: ``Computationally tractable approximate and smoothed Polya trees

This page was built for publication: Erratum

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887746)