Pages that link to "Item:Q1762989"
From MaRDI portal
The following pages link to Approximation schemes for degree-restricted MST and red-blue separation problems (Q1762989):
Displaying 13 items.
- Polynomial area bounds for MST embeddings of trees (Q654291) (← links)
- Cooperative TSP (Q982655) (← links)
- Degree-bounded minimum spanning trees (Q1028423) (← links)
- Planar bichromatic minimum spanning trees (Q1044035) (← links)
- Plane bichromatic trees of low degree (Q1650794) (← links)
- Approximation schemes for node-weighted geometric Steiner tree problems (Q2391178) (← links)
- On approximability of optimization problems related to red/blue-split graphs (Q2399618) (← links)
- Delineating boundaries for imprecise regions (Q2479529) (← links)
- The Shortest Separating Cycle Problem (Q2971152) (← links)
- Approximation schemes for degree-restricted MST and red-blue separation problem (Q4449174) (← links)
- Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem (Q5458860) (← links)
- Planar Bichromatic Bottleneck Spanning Trees (Q5874461) (← links)
- Exact and heuristic solutions for the prize‐collecting geometric enclosure problem (Q6154939) (← links)