The following pages link to (Q4633905):
Displaying 4 items.
- Approximating some network design problems with node costs (Q638508) (← links)
- How to Secure Matchings Against Edge Failures (Q5090488) (← links)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)
- Navigational guidance -- a deep learning approach (Q6113464) (← links)
