Pages that link to "Item:Q873648"
From MaRDI portal
The following pages link to A factor 2 approximation algorithm for the generalized Steiner network problem (Q873648):
Displaying 11 items.
- Approximations for the Steiner multicycle problem (Q6109004) (← links)
- Approximation algorithms for flexible graph connectivity (Q6120848) (← links)
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree (Q6156028) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q6200809) (← links)
- Cluster before you hallucinate: node-capacitated network design and energy efficient routing (Q6550988) (← links)
- Improved approximations for relative survivable network design (Q6574948) (← links)
- Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions (Q6586662) (← links)
- Better-than-\(\frac{4}{3}\)-approximations for leaf-to-leaf tree and connectivity augmentation (Q6608041) (← links)
- Approximations for the Steiner multicycle problem (Q6634374) (← links)
- The parameterized complexity of the survivable network design problem (Q6655676) (← links)
- Design of survivable networks with low connectivity requirements (Q6659118) (← links)