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 32 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)
- An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes (Q477657) (← 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)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q2117101) (← links)
- On approximating degree-bounded network design problems (Q2134742) (← links)
- Approximating minimum Manhattan networks in higher dimensions (Q2258071) (← links)
- Worst-case performance of Wong's Steiner tree heuristic (Q2489899) (← links)
- The polymatroid Steiner problems (Q2569165) (← links)
- A greedy approximation algorithm for the group Steiner problem (Q2581556) (← links)
- Combination algorithms for Steiner tree variants (Q2700384) (← links)
- An improved approximation scheme for the Group Steiner Problem (Q2709886) (← links)
- A Practical Greedy Approximation for the Directed Steiner Tree Problem (Q2942396) (← links)
- A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems (Q3009777) (← links)
- (Q4551390) (← links)
- Online Buy-at-Bulk Network Design (Q4577806) (← links)
- Bounded Degree Group Steiner Tree Problems (Q5041204) (← links)
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems (Q5085153) (← links)
- Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q5270408) (← links)
- (Q5708491) (← links)
- $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm (Q5890148) (← 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)
- Parameterized algorithms for the Steiner arborescence problem on a hypercube (Q6659999) (← links)
