Pages that link to "Item:Q4962716"
From MaRDI portal
The following pages link to On the approximability of some network design problems (Q4962716):
Displayed 10 items.
- On a class of branching problems in broadcasting and distribution (Q1761092) (← links)
- A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design (Q2015804) (← links)
- An improved approximation algorithm for the uniform cost-distance Steiner tree problem (Q2117699) (← links)
- Parameterized analysis of the online priority and node-weighted Steiner tree problems (Q2322716) (← links)
- Approximation algorithms for priority Steiner tree problems (Q2695278) (← links)
- Multi-level Steiner Trees (Q4984869) (← links)
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems (Q5085153) (← links)
- Multi-Level Steiner Trees. (Q5140725) (← links)
- (Q5874465) (← links)
- Multi-priority graph sparsification (Q6182885) (← links)