The Clustered Selected-Internal Steiner Tree Problem

DOI10.1142/s0129054121500362zbMath1522.68393arXiv2011.00131OpenAlexW3214751834MaRDI QIDQ6114856

Yen Hung Chen

Publication date: 15 August 2023

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.00131

zbMATH Keywords

approximation algorithmsdesign and analysis of algorithmsselected-internal Steiner treefacility allocation in networksclustered selected-internal Steiner treeclustered Steiner tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved approximation algorithm for the clustered traveling salesman problem
• A better constant-factor approximation for selected-internal Steiner minimum tree
• Approximating the selected-internal Steiner tree
• The Steiner problem with edge lengths 1 and 2
• The Steiner tree problem
• Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
• A faster approximation algorithm for the Steiner tree problem in graphs
• Advances in Steiner trees
• On the clustered Steiner tree problem
• An 11/6-approximation algorithm for the network Steiner problem
• Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs
• Steiner problem in networks: A survey
• The Complexity of Computing Steiner Minimal Trees
• Improved Approximations for the Steiner Tree Problem
• Thek-Steiner Ratio in Graphs
• A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
• The bottleneck selected‐internal and partial terminal Steiner tree problems
• APPROXIMATING ASYMMETRIC TSP IN EXPONENTIAL TIME
• A distributed dual ascent algorithm for Steiner problems in multicast routing
• Tighter Bounds for Graph Steiner Tree Approximation
• Steiner Tree Approximation via Iterative Randomized Rounding
• Lower bounds for the relative greedy algorithm for approximating Steiner trees
• On the Cube of a Graph
• Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE

This page was built for publication: The Clustered Selected-Internal Steiner Tree Problem