Pages that link to "Item:Q2875185"
From MaRDI portal
The following pages link to An improved LP-based approximation for Steiner tree (Q2875185):
Displaying 14 items.
- Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem (Q4922116) (← links)
- On the Integrality Gap of the Prize-Collecting Steiner Forest LP (Q5002620) (← links)
- Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree (Q5012805) (← links)
- The Steiner Problem for Count Matroids (Q5041203) (← links)
- Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set (Q5131722) (← links)
- Designing Networks with Good Equilibria under Uncertainty (Q5232329) (← links)
- A PTAS for the Steiner Forest Problem in Doubling Metrics (Q5376440) (← links)
- (Q5743405) (← links)
- Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE (Q5859656) (← links)
- Travelling on graphs with small highway dimension (Q5925522) (← links)
- Steiner connectivity problems in hypergraphs (Q6072212) (← links)
- Robust Algorithms for TSP and Steiner Tree (Q6075747) (← links)
- NeuroPrim: an attention-based model for solving NP-hard spanning tree problems (Q6564769) (← links)
- Fully dynamic algorithms for Euclidean Steiner tree (Q6575381) (← links)