Pages that link to "Item:Q1317004"

The following pages link to A greedy heuristic for a minimum-weight forest problem (Q1317004):

Displaying 12 items.

• Complexity and approximation of the constrained forest problem (Q553340) (← links)
• Another greedy heuristic for the constrained forest problem (Q813973) (← links)
• An approximation algorithm for network design problems with downwards-monotone demand functions (Q928296) (← links)
• Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
• Approximation algorithms for minimum tree partition (Q1270776) (← links)
• On the complexity of graph tree partition problems. (Q1421460) (← links)
• Heuristic approaches for the optimal wiring in large scale robotic skin design (Q1761221) (← links)
• Approximating minimum-cost graph problems with spanning tree edges (Q1892100) (← links)
• A 3/2-approximation algorithm for some minimum-cost graph problems (Q2340276) (← links)
• A class of heuristics for the constrained forest problem (Q2581555) (← links)
• md-MST is NP-hard for (Q2883542) (← links)
• Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations (Q2914198) (← links)