1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two

Simple item page
dc.creatorBerman, Piotr
dc.creatorKarpinski, Marek
dc.creatorZelikovsky, Alex
dc.date2008-10-10
dc.date.accessioned2026-07-07T10:09:09Z
dc.date.available2026-07-07T10:09:09Z
dc.descriptionWe give a 1.25 approximation algorithm for the Steiner Tree Problem with distances one and two, improving on the best known bound for that problem.
dc.identifierhttps://arxiv.org/abs/0810.1851
dc.identifierhttp://arxiv.org/abs/0810.1851
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/171231
dc.subjectComputational Complexity
dc.subjectDiscrete Mathematics
dc.subjectData Structures and Algorithms
dc.title1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two
dc.typetext

Files

Collections

arXiv