The following pages link to (Q4638871):
Displaying 9 items.
- Local geometric spanners (Q2067671) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q2117101) (← links)
- Call admission problems on grids with advice (Q2136274) (← links)
- Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs (Q2285135) (← links)
- Handbook of Approximation Algorithms and Metaheuristics (Q3416500) (← links)
- Minimum shared‐power edge cut (Q6066053) (← links)
- Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the <scp>VeRoLog</scp> Solver Challenge 2019 (Q6092663) (← links)
- Tighter bounds for the harmonic bin packing algorithm (Q6586257) (← links)
- The parameterized complexity of the survivable network design problem (Q6655676) (← links)