The minimum spanning tree problem with non-terminal set

DOI10.1016/J.IPL.2012.06.012zbMATH Open1248.68226OpenAlexW2090857456MaRDI QIDQ456089FDOQ456089

Ying Yin, Tongquan Zhang

Publication date: 23 October 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.06.012

zbMATH Keywords

approximation algorithmsNP-completenessminimum spanning tree problemnon-terminal set

Mathematics Subject Classification ID

Trees (05C05) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Cites Work

• Title not available (Why is that?)
• A Randomized Rounding Approach to the Traveling Salesman Problem
• Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
• On approximation algorithms for the terminal Steiner tree problem
• A note on the terminal Steiner tree problem
• Algorithms for terminal Steiner trees

Cited In (2)

• On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions
• Title not available (Why is that?)

This page was built for publication: The minimum spanning tree problem with non-terminal set

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