المؤلفون: Haepler, Bernhard, Hershkowitz, D. Ellis, Zuzic, Goran, id_orcid:0 000-0002-9322-6329

المساهمون: Chechik, Shiri, Navarro, Gonzalo, Rotenberg, Eva, Herman, Grzegorz

المصدر: Leibniz International Proceedings in Informatics (LIPIcs), 244 ; 30th Annual European Symposium on Algorithms (ESA 2022)

مصطلحات موضوعية: Tree Metrics, metric embeddings, approximation algorithms, group Steiner forest, group Steiner tree, demand-robust algorithms, online algorithms, deterministic algorithm

وصف الملف: application/application/pdf

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-247-1; info:eu-repo/grantAgreement/SNF/Projekte MINT/184735; http://hdl.handle.net/20.500.11850/571183; urn:isbn:978-3-95977-247-1

الاتاحة: https://hdl.handle.net/20.500.11850/571183
https://doi.org/10.3929/ethz-b-000571183

المؤلفون: Bernhard Haepler and D. Ellis Hershkowitz and Goran Zuzic, Haepler, Bernhard, Hershkowitz, D. Ellis, Zuzic, Goran

مصطلحات الفهرس: Tree metrics, metric embeddings, approximation algorithms, group Steiner forest, group Steiner tree, demand-robust algorithms, online algorithms, deterministic algorithms, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.63
Is Part Of LIPIcs, Volume 244, 30th Annual European Symposium on Algorithms (ESA 2022)