Pages that link to "Item:Q476424"
From MaRDI portal
The following pages link to Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424):
Displayed 9 items.
- Near-linear-time deterministic plane Steiner spanners for well-spaced point sets (Q906836) (← links)
- The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem (Q2090221) (← links)
- Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
- Special Frequency Quadrilaterals and an Application (Q3305469) (← links)
- A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface (Q3452802) (← links)
- A quick method to compute sparse graphs for traveling salesman problem using random frequency quadrilaterals (Q5024637) (← links)
- Minimum Cuts in Surface Graphs (Q5885599) (← links)
- Walking through waypoints (Q5918830) (← links)
- Correlation clustering and two-edge-connected augmentation for planar graphs (Q6046943) (← links)