Pages that link to "Item:Q5009577"
From MaRDI portal
The following pages link to Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577):
Displaying 5 items.
- A tight lower bound for planar Steiner orientation (Q1999967) (← links)
- To close is easier than to open: dual parameterization to \(k\)-median (Q2117693) (← links)
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals (Q5090473) (← links)
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
- Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices (Q5857009) (← links)
