Pages that link to "Item:Q5191526"
From MaRDI portal
The following pages link to FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191526):
Displaying 4 items.
- On approximating degree-bounded network design problems (Q2134742) (← links)
- Approximation algorithms for finding low-degree subgraphs (Q4651931) (← links)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)
- On approximating degree-bounded network design problems (Q6084395) (← links)