Pages that link to "Item:Q5369505"
From MaRDI portal
The following pages link to A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs (Q5369505):
Displaying 4 items.
- Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound (Q614043) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q2117101) (← links)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q6200809) (← links)