Pages that link to "Item:Q4939606"
From MaRDI portal
The following pages link to Approximation Algorithms for Directed Steiner Problems (Q4939606):
Displaying 50 items.
- Multi-rooted greedy approximation of directed Steiner trees with applications (Q262265) (← links)
- A practical greedy approximation for the directed Steiner tree problem (Q346528) (← links)
- On some network design problems with degree constraints (Q355516) (← links)
- Approximation algorithms for orienting mixed graphs (Q390889) (← links)
- On the approximability of dense Steiner problems (Q396661) (← 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)
- Preprocessing for a map sectorization problem by means of mathematical programming (Q490244) (← links)
- On the hardness of full Steiner tree problems (Q491161) (← links)
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
- Register loading via linear programming (Q494793) (← links)
- A tight algorithm for strongly connected Steiner subgraph on two terminals with demands (Q524378) (← links)
- Approximating fault-tolerant group-Steiner problems (Q764316) (← links)
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
- New primal-dual algorithms for Steiner tree problems (Q868154) (← links)
- Tight approximation algorithm for connectivity augmentation problems (Q931712) (← links)
- Low-light trees, and tight lower bounds for Euclidean spanners (Q972609) (← links)
- A note on Rooted Survivable Networks (Q990935) (← links)
- Inapproximability of survivable networks (Q1019191) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- An approach for the Steiner problem in directed graphs (Q1179756) (← links)
- Directed Steiner problems with connectivity constraints (Q1315992) (← links)
- Swap-vertex based neighborhood for Steiner tree problems (Q1699620) (← links)
- Clearing directed subgraphs by mobile agents. Variations on covering with paths (Q1741492) (← links)
- An algorithmic framework for the exact solution of tree-star problems (Q1753556) (← links)
- On a class of branching problems in broadcasting and distribution (Q1761092) (← links)
- The General Steiner Tree-Star problem. (Q1853139) (← links)
- On approximation of dominating tree in wireless sensor networks (Q1958639) (← links)
- 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)
- Greedy algorithms for the profit-aware social team formation problem (Q2168713) (← links)
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences (Q2189916) (← links)
- A polylogarithmic approximation algorithm for 2-edge-connected dominating set (Q2234806) (← links)
- Approximating minimum Manhattan networks in higher dimensions (Q2258071) (← links)
- Parameterized analysis of the online priority and node-weighted Steiner tree problems (Q2322716) (← links)
- Hardness and approximation results for packing Steiner trees (Q2369873) (← links)
- Approximating node-connectivity augmentation problems (Q2429349) (← links)
- The subdivision-constrained routing requests problem (Q2436672) (← links)
- Steiner diagrams and \(k\)-star hubs (Q2466026) (← links)
- Bounded-hops power assignment in ad hoc wireless networks (Q2492211) (← links)
- Approximating the two-level facility location problem via a quasi-greedy approach (Q2494518) (← links)
- The polymatroid Steiner problems (Q2569165) (← links)
- A greedy approximation algorithm for the group Steiner problem (Q2581556) (← links)
- Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions (Q2657274) (← links)
- Combination algorithms for Steiner tree variants (Q2700384) (← links)
- A Practical Greedy Approximation for the Directed Steiner Tree Problem (Q2942396) (← links)
- A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract) (Q2946016) (← links)
- On Directed Steiner Trees with Multiple Roots (Q3181063) (← links)
- (Q3304124) (← links)
