Approximation Algorithms for Directed Steiner Tree Problem in Graphs with Sparse Splitting Nodes
碩士 === 國立清華大學 === 通訊工程研究所 === 102 === 因申請專利緣故,資料延後公開
Main Authors: | Lee, Cheng-Wei, 李政緯 |
---|---|
Other Authors: | Lin, Hwa-Chun |
Format: | Others |
Language: | zh-TW |
Published: |
2014
|
Online Access: | http://ndltd.ncl.edu.tw/handle/ejdqw6 |
Similar Items
-
Approximation Algorithm for Directed Steiner Tree Problem with Agent
by: Lan, Jia-Jiunn, et al.
Published: (2013) -
Efficient Approximation Algorithms for Solving Directed Steiner Tree Problem
by: Chang, Ting-Wei, et al.
Published: (2013) -
A Faster Approximation Algorithm for Directed Steiner Tree Problem
by: Ming-I Hsieh, et al.
Published: (2003) -
Approximation Algorithms for Degree-Constrained Directed Steiner Tree Problem
by: Huang, Li Yuan, et al.
Published: (2015) -
Node-weighted Steiner tree and group Steiner tree in planar graphs
by: Demaine, Erik D., et al.
Published: (2011)