A quantization framework for smoothed analysis of Euclidean optimization problems
From MaRDI portal
Publication:893320
Recommendations
- A quantization framework for smoothed analysis of Euclidean optimization problems
- Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals
- Smoothed analysis of partitioning algorithms for Euclidean functionals
- Typical Properties of Winners and Losers [0.2ex] in Discrete Optimization
- Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems
Cites work
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 1246230 (Why is no real title available?)
- A PTAS for k-means clustering based on weak coresets
- A local search approximation algorithm for \(k\)-means clustering
- A polynomial algorithm for b-matchings: An alternative approach
- A quantization framework for smoothed analysis of Euclidean optimization problems
- A survey of heuristics for the weighted matching problem
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- Bin packing can be solved within 1+epsilon in linear time
- Center-based clustering under perturbation stability
- Euclidean matching problems and the metropolis algorithm
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- On coresets for k-means and k-median clustering
- Partitioning heuristics for two geometric maximization problems
- Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems
- Smoothed analysis of algorithms
- Smoothed analysis of partitioning algorithms for Euclidean functionals
- Smoothed analysis of the \(k\)-means method
- Solving a "Hard" problem to approximate an "Easy" one
- Stochastic mean payoff games: smoothed analysis and approximation schemes
- Subadditive Euclidean functionals and nonlinear growth in geometric probability
- The geometric maximum traveling salesman problem
- The planar \(k\)-means problem is NP-hard
- Two Algorithmic Results for the Traveling Salesman Problem
- Typical Properties of Winners and Losers [0.2ex] in Discrete Optimization
- Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP (extended abstract)
- Worst-case and smoothed analysis of the ICP algorithm, with an application to the k-means method
Cited in
(4)
This page was built for publication: A quantization framework for smoothed analysis of Euclidean optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q893320)
