Pages that link to "Item:Q4962654"
From MaRDI portal
The following pages link to An Improved Approximation for <i>k</i> -Median and Positive Correlation in Budgeted Optimization (Q4962654):
Displayed 40 items.
- Local search algorithm for the squared metric \(k\)-facility location problem with linear penalties (Q1983746) (← links)
- Faster balanced clusterings in high dimension (Q2006774) (← links)
- Approximation algorithms for the lower-bounded \(k\)-median and its generalizations (Q2019514) (← links)
- Approximating the \(\tau\)-relaxed soft capacitated facility location problem (Q2023133) (← links)
- Approximation algorithms for the lower-bounded knapsack median problem (Q2039651) (← links)
- On perturbation resilience of non-uniform \(k\)-center (Q2072096) (← links)
- The traveling \(k\)-median problem: approximating optimal network coverage (Q2085738) (← links)
- Lossy kernelization of same-size clustering (Q2097218) (← links)
- Improved approximation algorithms for solving the squared metric \(k\)-facility location problem (Q2110368) (← links)
- On parameterized approximation algorithms for balanced clustering (Q2111529) (← links)
- An improved approximation algorithm for squared metric \(k\)-facility location (Q2150578) (← links)
- Improved parameterized approximation for balanced \(k\)-median (Q2150584) (← links)
- An improved \((1+1)\) evolutionary algorithm for \(k\)-Median clustering problem with performance guarantee (Q2164835) (← links)
- Approximation algorithms for clustering with dynamic points (Q2168849) (← links)
- Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem (Q2217474) (← links)
- Approximation algorithms for spherical \(k\)-means problem using local search scheme (Q2220852) (← links)
- Iterative partial rounding for vertex cover with hard capacities (Q2223692) (← links)
- The ordered \(k\)-median problem: surrogate models and approximation algorithms (Q2316614) (← links)
- Local search approximation algorithms for the \(k\)-means problem with penalties (Q2420650) (← links)
- On clustering with discounts (Q2671820) (← links)
- Better guarantees for \(k\)-median with service installation costs (Q2672628) (← links)
- Local Search Yields a PTAS for $k$-Means in Doubling Metrics (Q4634026) (← links)
- Proportional Approval Voting, Harmonic k-median, and Negative Association (Q5002696) (← links)
- (Q5002778) (← links)
- (Q5009501) (← links)
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension (Q5009565) (← links)
- (Q5075771) (← links)
- Discrete facility location in machine learning (Q5100135) (← links)
- (Q5214247) (← links)
- (Q5874506) (← links)
- (Q5874528) (← links)
- (Q5874534) (← links)
- On the cost of essentially fair clusterings (Q5875470) (← links)
- Effective Heuristic Techniques for Combined Robust Clustering Problem (Q6053497) (← links)
- (Q6062155) (← links)
- Approximation algorithms for the individually fair \(k\)-center with outliers (Q6064038) (← links)
- A unified framework of FPT approximation algorithms for clustering problems (Q6065394) (← links)
- FPT Approximation for Constrained Metric k-Median/Means (Q6089659) (← links)
- Approximation algorithms for diversity-bounded center problems (Q6111979) (← links)
- Lossy kernelization of same-size clustering (Q6174654) (← links)