Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem

Algorithmica ◽

10.1007/s00453-018-00533-w ◽

2018 ◽

Vol 81 (11-12) ◽

pp. 4167-4199

Author(s):

Zhi-Zhong Chen ◽

Guohui Lin ◽

Lusheng Wang ◽

Yong Chen ◽

Dan Wang

Keyword(s):

Approximation Algorithms ◽

Spanning Tree ◽

Download Full-text

Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-62389-4_11 ◽

2017 ◽

pp. 124-136

Author(s):

Zhi-Zhong Chen ◽

Guohui Lin ◽

Lusheng Wang ◽

Yong Chen ◽

Dan Wang

Keyword(s):

Approximation Algorithms ◽

Spanning Tree ◽

Download Full-text

Approximation Algorithms for Quickest Spanning Tree Problems

Algorithmica ◽

10.1007/s00453-004-1118-x ◽

2004 ◽

Vol 41 (1) ◽

pp. 43-52

Author(s):

Refael Hassin ◽

Asaf Levin

Keyword(s):

Approximation Algorithms ◽

Download Full-text

Approximation algorithms for the optimal p-source communication spanning tree

Discrete Applied Mathematics ◽

10.1016/j.dam.2003.10.002 ◽

2004 ◽

Vol 143 (1-3) ◽

pp. 31-42 ◽

Author(s):

Bang Ye Wu

Keyword(s):

Approximation Algorithms ◽

Download Full-text

Approximation Algorithms for Some Optimum Communication Spanning Tree Problems

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-49381-6_43 ◽

1998 ◽

pp. 408-416 ◽

Author(s):

Bang Ye Wu ◽

Kun-Mao Chao ◽

Chuan Yi Tang

Keyword(s):

Approximation Algorithms ◽

Download Full-text

Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27836-8_68 ◽

2004 ◽

pp. 805-818 ◽

Author(s):

Raja Jothi ◽

Balaji Raghavachari

Keyword(s):

Approximation Algorithms ◽

Network Design ◽

Spanning Tree ◽

Minimum Spanning Tree ◽

Capacitated Minimum Spanning Tree ◽

Minimum Spanning Tree Problem

Download Full-text

Approximation Algorithms for the Maximum Internal Spanning Tree Problem

Mathematical Foundations of Computer Science 2007 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74456-6_10 ◽

2007 ◽

pp. 90-102 ◽

Author(s):

Gábor Salamon

Keyword(s):

Approximation Algorithms ◽

Download Full-text

Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-642-03367-4_40 ◽

2009 ◽

pp. 459-470 ◽

Author(s):

Martin Knauer ◽

Joachim Spoerhase

Keyword(s):

Approximation Algorithms ◽

Download Full-text

Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-29116-6_7 ◽

2012 ◽

pp. 77-88 ◽

Author(s):

Nadine Schwartges ◽

Joachim Spoerhase ◽

Alexander Wolff

Keyword(s):

Approximation Algorithms ◽

Download Full-text

Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design

ACM Transactions on Algorithms ◽

10.1145/1103963.1103967 ◽

2005 ◽

Vol 1 (2) ◽

pp. 265-282 ◽

Author(s):

Raja Jothi ◽

Balaji Raghavachari

Keyword(s):

Approximation Algorithms ◽

Network Design ◽

Spanning Tree ◽

Minimum Spanning Tree ◽

Capacitated Minimum Spanning Tree ◽

Minimum Spanning Tree Problem

Download Full-text

Approximation algorithms for the shortest total path length spanning tree problem

Discrete Applied Mathematics ◽

10.1016/s0166-218x(00)00185-2 ◽

2000 ◽

Vol 105 (1-3) ◽

pp. 273-289 ◽

Author(s):

Bang Ye Wu ◽

Kun–Mao Chao ◽

Chuan Yi Tang

Keyword(s):

Approximation Algorithms ◽

Spanning Tree ◽

Path Length ◽

Total Path Length

Download Full-text