Pages that link to "Item:Q2819529"
From MaRDI portal
The following pages link to A constant-factor approximation algorithm for the <i>k</i> -median problem (extended abstract) (Q2819529):
Displayed 50 items.
- Network Cross-Validation for Determining the Number of Communities in Network Data (Q159626) (← links)
- Improved algorithms for joint optimization of facility locations and network connections (Q322548) (← links)
- Approximate solution of the \(p\)-median minimization problem (Q519693) (← links)
- Grouping objects in multi-band images using an improved eigenvector-based algorithm (Q604192) (← links)
- A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems (Q747779) (← links)
- Center-based clustering under perturbation stability (Q763489) (← links)
- The reverse greedy algorithm for the metric k-median problem (Q1045901) (← links)
- An approximation algorithm for soft capacitated \(k\)-facility location problem (Q1702830) (← links)
- An improved approximation algorithm for knapsack median using sparsification (Q1751085) (← links)
- Clustering to minimize the sum of cluster diameters (Q1887718) (← links)
- Local search algorithm for the squared metric \(k\)-facility location problem with linear penalties (Q1983746) (← links)
- A factor graph model for unsupervised feature selection (Q2004730) (← links)
- To close is easier than to open: dual parameterization to \(k\)-median (Q2117693) (← links)
- An improved \((1+1)\) evolutionary algorithm for \(k\)-Median clustering problem with performance guarantee (Q2164835) (← links)
- LP-based approximation for uniform capacitated facility location problem (Q2172086) (← links)
- Reverse greedy is bad for \(k\)-center (Q2308462) (← links)
- The ordered \(k\)-median problem: surrogate models and approximation algorithms (Q2316614) (← links)
- Consistency of spectral clustering in stochastic block models (Q2338925) (← links)
- Convexified modularity maximization for degree-corrected stochastic block models (Q2413602) (← links)
- Local search approximation algorithms for the \(k\)-means problem with penalties (Q2420650) (← links)
- A \(k\)-product uncapacitated facility location problem (Q2455617) (← links)
- Approximation algorithms for hard capacitated \(k\)-facility location problems (Q2630091) (← links)
- An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation (Q3186508) (← links)
- An Improved Approximation Algorithm for Knapsack Median Using Sparsification (Q3452792) (← links)
- Local Search Algorithms for k-Median and k-Facility Location Problems with Linear Penalties (Q3467834) (← links)
- Agnostic Clustering (Q3648765) (← links)
- Efficient algorithms for centers and medians in interval and circular-arc graphs (Q4537621) (← links)
- A Streaming Algorithm for k-Means with Approximate Coreset (Q4631688) (← links)
- Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems (Q4689624) (← links)
- Ant colony optimization for finding medians of weighted graphs (Q4908024) (← links)
- (Q5009501) (← links)
- Constant-Factor FPT Approximation for Capacitated k-Median (Q5075732) (← links)
- Constant factor approximation algorithm for uniform hard capacitated knapsack median problem (Q5090959) (← links)
- (Q5091167) (← links)
- Clustering to minimize the sum of cluster diameters (Q5175947) (← links)
- Approximating min-sum <i>k</i> -clustering in metric spaces (Q5175948) (← links)
- Local search heuristic for k-median and facility location problems (Q5175949) (← links)
- Profit-earning facility location (Q5175950) (← links)
- One-dimensional quantum walks (Q5175951) (← links)
- Quantum walks on graphs (Q5175952) (← links)
- Quantum algorithms for solvable groups (Q5175953) (← links)
- Quantum mechanical algorithms for the nonabelian hidden subgroup problem (Q5175954) (← links)
- Minimax parametric optimization problems and multi-dimensional parametric searching (Q5175955) (← links)
- Algorithms for minimizing weighted flow time (Q5175956) (← links)
- Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines (Q5175957) (← links)
- Stackelberg scheduling strategies (Q5175958) (← links)
- Quantum computers that can be simulated classically in polynomial time (Q5175959) (← links)
- Interaction in quantum communication and the complexity of set disjointness (Q5175960) (← links)
- A new protocol and lower bounds for quantum coin flipping (Q5175961) (← links)
- Loss-less condensers, unbalanced expanders, and extractors (Q5175962) (← links)
