#🔒 Steiner Tree with a cost contraint and a root node.

4 messages · Page 1 of 1 (latest)

tender vortex
#

Given a graph of 1000 nodes, how do I find a Steiner Tree covering maximum number of nodes possible within N Steiner nodes with the diameter (total cost) under a constraint and this Steiner Tree must contain a specific root node? I have gone through some googling and bunch math papers that talk about LP, Branch and Bound, Machine learning but it’s all maths, there was no pseudocode. Can someone please help?

azure merlinBOT
#

@tender vortex

Python help channel opened

Remember to:

  • Ask your Python question, not if you can ask or if there's an expert who can help.
  • Show a code sample as text (rather than a screenshot) and the error message, if you've got one.
  • Explain what you expect to happen and what actually happens.

:warning: Do not pip install anything that isn't related to your question, especially if asked to over DMs.

Closes after a period of inactivity, or when you send !close.
azure merlinBOT
#

@tender vortex

Python help channel closed

This help channel has been closed and it's no longer possible to send messages here. If your question wasn't answered, feel free to create a new post in #1035199133436354600. To maximize your chances of getting a response, check out this guide on asking good questions.