Pages that link to "Item:Q1892100"

The following pages link to Approximating minimum-cost graph problems with spanning tree edges (Q1892100):

Displaying 19 items.

• An approximation algorithm for network design problems with downwards-monotone demand functions (Q928296) (← links)
• Minimum cost spanning tree problems with groups (Q964464) (← links)
• Additivity in minimum cost spanning tree problems (Q999732) (← links)
• Edge exchanges in the degree-constrained minimum spanning tree problem (Q1086497) (← links)
• Approximation algorithms for minimum tree partition (Q1270776) (← links)
• Upgrading min-max spanning tree problem under various cost functions (Q1680539) (← links)
• A survey of the standard location-routing problem (Q1698292) (← links)
• Approximation algorithms for constructing required subgraphs using stock pieces of fixed length (Q2082192) (← 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)
• An axiomatic approach in minimum cost spanning tree problems with groups (Q2348765) (← links)
• On the set of extreme core allocations for minimal cost spanning tree problems (Q2397642) (← links)
• Minimum cost spanning tree problems as value sharing problems (Q2689423) (← links)
• (Q3142820) (← links)
• A polynomial time approximation scheme for the two-source minimum routing cost spanning trees (Q4805401) (← links)
• Eulerian location problems (Q4934874) (← links)
• Approximation Algorithms for a Network Design Problem (Q5323067) (← links)
• A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time (Q5874522) (← links)
• Improving the approximation ratio for capacitated vehicle routing (Q5925635) (← links)