Pages that link to "Item:Q1951575"
From MaRDI portal
The following pages link to Approximation algorithms for spanner problems and directed Steiner forest (Q1951575):
Displaying 18 items.
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Lasserre integrality gaps for graph spanners and related problems (Q2117692) (← links)
- On the approximability and hardness of the minimum connected dominating set with routing cost constraint (Q2326407) (← links)
- Roots of bivariate polynomial systems via determinantal representations (Q2797076) (← links)
- Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q2849356) (← links)
- Finding sparser directed spanners (Q2908874) (← links)
- On Directed Steiner Trees with Multiple Roots (Q3181063) (← links)
- Online Buy-at-Bulk Network Design (Q4577806) (← links)
- (Q4638107) (← links)
- ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network (Q4993301) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← 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)
- (Q5875462) (← links)
- Reachability Preservers: New Extremal Bounds and Approximation Algorithms (Q6154193) (← links)