Pages that link to "Item:Q4962627"

The following pages link to Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications (Q4962627):

Displaying 10 items.

• Representative families for matroid intersections, with applications to location, packing, and covering problems (Q2028091) (← links)
• Improved approximation for prize-collecting red-blue median (Q2043014) (← links)
• Constant approximation for fault-tolerant median problems via iterative rounding (Q2157915) (← links)
• Approximation algorithms for clustering with dynamic points (Q2168849) (← links)
• The distance-constrained matroid median problem (Q2182102) (← links)
• On some variants of Euclidean \(k\)-supplier (Q2670484) (← links)
• On clustering with discounts (Q2671820) (← links)
• (Q5091192) (← links)
• The Euclidean <i>k</i>-Supplier Problem (Q5108254) (← links)
• Approximation Algorithms for Matroid and Knapsack Means Problems (Q6053494) (← links)