New Pruning Rules for the Steiner Tree Problem and 2-Connected Steiner Network Problem

Computational Geometry: Theory and Applications - Netherlands
doi 10.1016/j.comgeo.2018.10.003
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Reduction Techniques for the Prize Collecting Steiner Tree Problem and the Maximum-Weight Connected Subgraph Problem

Networks
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
2018English

The Steiner Tree Reoptimization Problem With Sharpened Triangle Inequality

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

The Minimum Steiner Tree Problem Based on Genetic Algorithm

DEStech Transactions on Computer Science and Engineering
2018English

Parallel Minimum Spanning Tree Heuristic for the Steiner Problem in Graphs

2007English

On the Covering Steiner Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Directed Steiner Tree Problem on a Graph: Models, Relaxations, and Algorithms

1988English

Numerical Approximation of the Steiner Problem in Dimension $2$ and $3$

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2019English

Two Variations of the Minimum Steiner Problem

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2005English

Fixed-Parameter Algorithms for Rectilinear Steiner Tree and Rectilinear Traveling Salesman Problem in the Plane

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy