Pages that link to "Item:Q5212767"
From MaRDI portal
The following pages link to <i>O</i> (log <sup>2</sup> <i>k</i> / log log <i>k</i> )-approximation algorithm for directed Steiner tree (Q5212767):
Displaying 11 items.
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q2117101) (← links)
- Tight bounds on subexponential time approximation of set cover and related problems (Q2117696) (← links)
- On approximating degree-bounded network design problems (Q2134742) (← links)
- Approximation algorithms for priority Steiner tree problems (Q2695278) (← links)
- Bounded Degree Group Steiner Tree Problems (Q5041204) (← links)
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems (Q5085153) (← links)
- A Spectral Approach to Network Design (Q5092510) (← links)
- A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs (Q5369505) (← links)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)
- Navigational guidance -- a deep learning approach (Q6113464) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q6200809) (← links)
