Pages that link to "Item:Q1892100"
From MaRDI portal
The following pages link to Approximating minimum-cost graph problems with spanning tree edges (Q1892100):
Displaying 6 items.
- An approximation algorithm for network design problems with downwards-monotone demand functions (Q928296) (← links)
- Approximation algorithms for minimum tree partition (Q1270776) (← links)
- A survey of the standard location-routing problem (Q1698292) (← links)
- A constant-factor approximation for directed latency in quasi-polynomial time (Q2119400) (← links)
- A 3/2-approximation algorithm for some minimum-cost graph problems (Q2340276) (← links)
- A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time (Q5874522) (← links)
