Approximate spanning cactus
No approximation algorithms are known for computing minimum spanning cactus and bottleneck spanning cactus. For minimum spanning cactus approximation algorithm with relative error ? is presented. For Bottleneck spanning cactus approximation algorithm with relative error 2??1 2 ? ? 1 is presented.
spanning cactus approximation algorithms np-completeness ?-triangle inequality minimum spanning tree