Pages that link to "Item:Q4952696"

The following pages link to A \(2 + \varepsilon\) approximation algorithm for the \(k\)-MST problem (Q4952696):

Displaying 23 items.

• A 2.5-factor approximation algorithm for the \(k\)-MST problem (Q293204) (← links)
• On the approximability of dense Steiner problems (Q396661) (← links)
• A better approximation algorithm for the budget prize collecting tree problem. (Q703233) (← links)
• Budget constrained minimum cost connected medians (Q876728) (← links)
• Approximation algorithm for minimizing total latency in machine scheduling with deliveries (Q924636) (← links)
• Computing small partial coverings (Q1007552) (← links)
• The bottleneck \(k\)-MST (Q1041824) (← links)
• A constant-factor approximation algorithm for the \(k\)-MST problem (Q1305925) (← links)
• Faster geometric \(k\)-point MST approximation (Q1370933) (← links)
• A note on the $k$-minimum spanning tree problem on circles (Q1785744) (← links)
• Subexponential algorithms for partial cover problems (Q1944141) (← links)
• A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem (Q2421447) (← links)
• A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem (Q2492706) (← links)
• Honey-pot constrained searching with local sensory information (Q2507866) (← links)
• Two multi-start heuristics for the \(k\)-traveling salesman problem (Q2656560) (← links)
• An \(O(\log k)\) approximation algorithm for the \(k\) minimum spanning tree problem in the plane (Q2817634) (← links)
• md-MST is NP-hard for \(d\geq 3\) (Q2883542) (← links)
• Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem (Q2942405) (← links)
• (Q4228499) (← links)
• Approximation algorithms for the covering Steiner problem (Q4537631) (← links)
• Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems (Q5210996) (← links)
• Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems (Q5860477) (← links)
• Simple heuristics for the rooted max tree coverage problem (Q6606188) (← links)