On reductions for the Steiner problem in graphs

DOI10.1016/S1570-8667(03)00008-XzbMATH Open1118.05315OpenAlexW2041885807MaRDI QIDQ876697FDOQ876697

Jeffrey H. Kingston, Nicholas Paul Sheppard

Publication date: 26 April 2007

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1570-8667(03)00008-x

zbMATH Keywords

reductionSteiner problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The Steiner tree problem
• On theories with a combinatorial definition of 'equivalence'
• Title not available (Why is that?)
• An algorithm for the steiner problem in graphs
• Network decomposition for the optimization of connection structures
• Reduction tests for the steiner problem in grapsh

Cited In (4)

• Problem reduction methods and a tree generation algorithm for the steiner network problem
• Title not available (Why is that?)
• Reductions for the rectilinear steiner tree problem
• On the hardness of computing maximum self-reduction sequences

   Recommendations

• Reduction tests for the steiner problem in grapsh 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• An edge elimination test for the Steiner problem in graphs 👍 👎

This page was built for publication: On reductions for the Steiner problem in graphs

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