1 Table of Contents: “... Topologies -- Steiner Trees, Coordinate Systems, and NP-Hardness -- Exact Algorithms for Plane Steiner Tree...”

2 Table of Contents: “...Steiner Minimum Trees in Uniform Orientation Metrics -- Genetic Algorithm Approaches to Solve...”

3 Table of Contents: “... -- Generating algorithm for quasi-full Steiner tree -- Analysing deletions in competitive self-adjusting linear...”

4 Table of Contents: “... Programming -- Exact Algorithms for the Bottleneck Steiner Tree Problem -- Exact Algorithms for Set Multicover...”

5 Table of Contents: “... pieces of fixed length -- A primal dual approximation algorithm for the multicut problem in trees...”

6 Table of Contents: “... -- Approximation algorithms for balancing signed graphs -- Computing the One-Visibility Copnumber of Trees...”

7 Table of Contents: “... trees -- General Rumor Blocking: An Efficient Random Algorithm with Martingale Approach -- A Robust...”

8 Table of Contents: “... Diversifying Improvement of the Minimum Power Multicast Tree Algorithms in Wireless Ad Hoc Networks...”

9 Table of Contents: “... for Hypergraph Communication Situations -- An Efficient Approximation Algorithm for the Steiner Tree Problem -- A...”

10 Table of Contents: “... Algorithm and Spanning Tree -- 5. Incremental Method and Maximum Network Flow -- 6. Linear Programming -- 7...”

11 Table of Contents: “... Routing -- A Moderately Exponential Time Algorithm for Full Degree Spanning Tree -- Speeding up Dynamic...”

12 Table of Contents: “... incremental algorithm for the closest pair problem using Leafary trees -- Testing containment of object...”

13 Table of Contents: “... Practical Greedy Approximation for the Directed Steiner Tree Problem -- Spanning Properties of Theta-Theta...”

14 Table of Contents: “... -- Size-Problems -- Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design...”

15 Table of Contents: “... for the Traffic Grooming in WDM Networks -- Elementary Approximation Algorithms for Prize Collecting Steiner Tree...”

16 Table of Contents: “...A role of minimum spanning tree -- Discrete Newton method -- An overview of submodular optimization...”

17 Table of Contents: “... Graphs -- An Approximation Algorithm for the B-prize-collecting Multicut Problem in Trees -- Two-Stage...”

18 Table of Contents: “... -- Approximate Algorithms and Heuristics for MAX-SAT -- Knapsack Problems -- Steiner Minimum Trees in E 3...”

19 Table of Contents: “... Algorithms for the Rooted Budgeted Cycle Cover Problem -- Evolutionary Equilibrium Analysis for Decision...”