Pages that link to "Item:Q1041722"
From MaRDI portal
The following pages link to Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth (Q1041722):
Displaying 6 items.
- New tools and connections for exponential-time approximation (Q2272598) (← links)
- Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems (Q3587419) (← links)
- On Algorithms Employing Treewidth for $L$-bounded Cut Problems (Q4637663) (← links)
- Algorithms and Computation (Q5191683) (← links)
- A strongly polynomial time algorithm for the maximum supply rate problem on trees (Q5896083) (← links)
- A strongly polynomial time algorithm for the maximum supply rate problem on trees (Q5919326) (← links)
