Pages that link to "Item:Q5419003"
From MaRDI portal
The following pages link to Linear Programming Hierarchies Suffice for Directed Steiner Tree (Q5419003):
Displaying 9 items.
- Clearing directed subgraphs by mobile agents. Variations on covering with paths (Q1741492) (← links)
- Approximating graph-constrained max-cut (Q1800989) (← links)
- On approximating degree-bounded network design problems (Q2134742) (← links)
- A comprehensive analysis of polyhedral lift-and-project methods (Q2790405) (← links)
- Max-Cut Under Graph Constraints (Q3186491) (← links)
- Lehman's Theorem and the Directed Steiner Tree Problem (Q3462549) (← links)
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems (Q5085153) (← 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)
