### Abstract

Given an edge-weighted undirected graph G=(V,E,c,w), where each edge e ∈ E has a cost c(e) and a weight w(e), a set S⊆V of terminals and a positive constant D _{0}, we seek a minimum cost Steiner tree where all terminals appear as leaves and its diameter is bounded by D _{0}. Note that the diameter of a tree represents the maximum weight of path connecting two different leaves in the tree. Such problem is called the minimum cost diameter-constrained Steiner tree problem. This problem is NP-hard even when the topology of Steiner tree is fixed. In present paper we focus on this restricted version and present a fully polynomial time approximation scheme (FPTAS) for computing a minimum cost diameter-constrained Steiner tree under a fixed topology.

Original language | English (US) |
---|---|

Title of host publication | Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Proceedings |

Pages | 243-253 |

Number of pages | 11 |

Edition | PART 2 |

DOIs | |

State | Published - Dec 1 2010 |

Event | 4th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2010 - Kailua-Kona, HI, United States Duration: Dec 18 2010 → Dec 20 2010 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Number | PART 2 |

Volume | 6509 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 4th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2010 |
---|---|

Country | United States |

City | Kailua-Kona, HI |

Period | 12/18/10 → 12/20/10 |

### Fingerprint

### Keywords

- Diameter-constrained Steiner tree
- fixed topology
- fully polynomial time approximation scheme

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Proceedings*(PART 2 ed., pp. 243-253). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6509 LNCS, No. PART 2). https://doi.org/10.1007/978-3-642-17461-2_20