Minimum diameter spanning trees and related problems
SIAM Journal on Computing
Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
Bicriteria network design problems
Journal of Algorithms
Fixed topology Steiner trees and spanning forests
Theoretical Computer Science
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms
Semi-online maintenance of geometric optima and measures
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the terminal Steiner tree problem
Information Processing Letters
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
A note on the terminal Steiner tree problem
Information Processing Letters
Graph Theory With Applications
Graph Theory With Applications
Algorithms for terminal Steiner trees
Theoretical Computer Science
Polynomial time approximation algorithms for multi-constrained QoS routing
IEEE/ACM Transactions on Networking (TON)
Steiner Tree Problems In Computer Communication Networks
Steiner Tree Problems In Computer Communication Networks
On the minimum diameter spanning tree problem
Information Processing Letters
Many-to-Many Multicast Routing under a Fixed Topology: Basic Architecture, Problems and Algorithms
ICNDC '10 Proceedings of the 2010 First International Conference on Networking and Distributed Computing
A linear time algorithm for computing a most reliable source on a tree network with faulty nodes
Theoretical Computer Science
An improved approximation algorithm for the terminal Steiner tree problem
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
An O(pn2) algorithm for the p -median and related problems on tree graphs
Operations Research Letters
| Hi-index | 0.00 |
Given an edge-weighted undirected graph $$G=(V,E,c,w)$$ where each edge $$e\in E$$ has a cost $$c(e)\ge 0$$ and another weight $$w(e)\ge 0$$, a set $$S\subseteq V$$ of terminals and a given constant $$\mathrm{C}_0\ge 0$$, the aim is to find a minimum diameter Steiner tree whose all terminals appear as leaves and the cost of tree is bounded by $$\mathrm{C}_0$$. The diameter of a tree refers to the maximum weight of the path connecting two different leaves in the tree. This problem is called the minimum diameter cost-constrained Steiner tree problem, which is NP-hard even when the topology of the Steiner tree is fixed. In this paper, we deal with the fixed-topology restricted version. We prove the restricted version to be polynomially solvable when the topology is not part of the input and propose a weakly fully polynomial time approximation scheme (weakly FPTAS) when the topology is part of the input, which can find a $$(1+\epsilon )$$---approximation of the restricted version problem for any $$\epsilon 0$$ with a specific characteristic.