Algorithms for a Variant of the Full Steiner Tree Problem

This paper studies a variant of the Steiner tree problem in the Euclidean plane ℝ 2 : the minimum-number of a specific material for the full Steiner tree problem (MNFST, for short). This question is an extension of the Steiner tree problem and the full Steiner tree problem. It has a wide range of ap...

Full description

Bibliographic Details

Published in:	2021 IEEE/ACIS 19th International Conference on Computer and Information Science (ICIS) pp. 16 - 21
Main Authors:	Wang, Haiyan, Huang, Binchao, Li, Jianping
Format:	Conference Proceeding
Language:	English
Published:	IEEE 23.06.2021
Subjects:	Approximation algorithms Information science NP-hard polynomial-time approximation algorithms Steiner trees subdivision the full Steiner tree problem
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!