Pages that link to "Item:Q5146834"
From MaRDI portal
The following pages link to Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems (Q5146834):
Displaying 5 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)
- $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm (Q5890148) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q6200809) (← links)
