Pages that link to "Item:Q1945289"
From MaRDI portal
The following pages link to Approximation algorithms via contraction decomposition (Q1945289):
Displaying 7 items.
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Bounding tree-width via contraction on the projective plane and torus (Q888611) (← links)
- Polynomial bounds for centered colorings on proper minor-closed graph classes (Q1984513) (← links)
- An LP-based approximation algorithm for the generalized traveling salesman path problem (Q2680860) (← links)
- A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface (Q3452802) (← links)
- The Greedy Spanner Is Existentially Optimal (Q4960447) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
