Pages that link to "Item:Q4962150"
From MaRDI portal
The following pages link to Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs (Q4962150):
Displayed 5 items.
- On the hardness of full Steiner tree problems (Q491161) (← links)
- An Efficient Approximation Algorithm for the Steiner Tree Problem (Q3297834) (← links)
- Hitting Weighted Even Cycles in Planar Graphs (Q5048307) (← links)
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
- Approximating node-weighted \(k\)-MST on planar graphs (Q5918856) (← links)