Pages that link to "Item:Q679453"
From MaRDI portal
The following pages link to A series of approximation algorithms for the acyclic directed Steiner tree problem (Q679453):
Displaying 14 items.
- Multi-rooted greedy approximation of directed Steiner trees with applications (Q262265) (← links)
- Directed Steiner trees with diffusion costs (Q346492) (← links)
- A practical greedy approximation for the directed Steiner tree problem (Q346528) (← links)
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- Register loading via linear programming (Q494793) (← links)
- Approximating fault-tolerant group-Steiner problems (Q764316) (← links)
- New primal-dual algorithms for Steiner tree problems (Q868154) (← links)
- Inapproximability of survivable networks (Q1019191) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems (Q5085153) (← links)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)
- On approximating degree-bounded network design problems (Q6084395) (← links)
- Navigational guidance -- a deep learning approach (Q6113464) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q6200809) (← links)
