A degree based approach to find Steiner trees

DOI10.1016/J.ENDM.2016.05.033zbMath1347.05031OpenAlexW2513418505MaRDI QIDQ327685

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

Publication date: 19 October 2016

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

zbMATH Keywords

algorithmSteiner tree

Mathematics Subject Classification ID

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

Cites Work

• On-line Steiner trees in the Euclidean plane
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Unnamed Item

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