A degree based approach to find Steiner trees

DOI10.1016/J.ENDM.2016.05.033zbMATH Open1347.05031OpenAlexW2513418505MaRDI QIDQ327685FDOQ327685

Authors: K. Divya, P. M. Amal, Kumar K. S. Ajish 

Publication date: 19 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.05.033

Recommendations

• Approximating the Minimum-Degree Steiner Tree to within One of Optimal
• Approaches to the Steiner Problem in Networks
• APPROXIMATION ALGORITHM FOR STEINER TREE PROBLEM WITH NEIGHBOR-INDUCED COST
• scientific article; zbMATH DE number 139910
• Improved Approximations for the Steiner Tree Problem

zbMATH Keywords

algorithmSteiner tree

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Cites Work

• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Title not available (Why is that?)
• On-line Steiner trees in the Euclidean plane

Cited In (3)

• Algorithms for degree-constrained Euclidean Steiner minimal tree
• An approximation algorithm for the Steiner connectivity problem
• The influence of preprocessing on Steiner tree approximations

This page was built for publication: A degree based approach to find Steiner trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q327685)