Pages that link to "Item:Q3434998"
From MaRDI portal
The following pages link to The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals (Q3434998):
Displayed 21 items.
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- A tight algorithm for strongly connected Steiner subgraph on two terminals with demands (Q524378) (← links)
- On the edge capacitated Steiner tree problem (Q2218647) (← links)
- Augmenting weighted graphs to establish directed point-to-point connectivity (Q2359805) (← links)
- The Steiner connectivity problem (Q2434988) (← links)
- Optimal data placement on networks with a constant number of clients (Q2453166) (← links)
- A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract) (Q2946016) (← links)
- Locally Semicomplete Digraphs and Generalizations (Q3120438) (← links)
- On Directed Steiner Trees with Multiple Roots (Q3181063) (← links)
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals (Q5090473) (← links)
- How to Secure Matchings Against Edge Failures (Q5090488) (← links)
- How to Secure Matchings against Edge Failures (Q5157391) (← links)
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
- Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs (Q5384532) (← links)
- (Q5743494) (← links)
- Parameterized certificate dispersal and its variants (Q5964075) (← links)
- Node connectivity augmentation via iterative randomized rounding (Q6038664) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- An ETH-tight algorithm for bidirected Steiner connectivity (Q6139039) (← links)
- Structural properties of minimum multi-source multi-sink Steiner networks in the Euclidean plane (Q6167087) (← links)