Query complexity of the metric Steiner tree problem

DOI10.1137/1.9781611977554.CH179MaRDI QIDQ6538709zbMATH OpenFDO

Authors Yu Chen, Sanjeev Khanna, Zihan Tan

Publication date 14 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977554.CH179

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Query complexity of the metric Steiner tree problem

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