scientific article; zbMATH DE number 1775394
From MaRDI portal
Publication:4542527
Recommendations
- A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem
- Approximation algorithms for geometric median problems
- Approximation Algorithms for the k-Median Problem
- A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)
- A constant-factor approximation algorithm for the k-median problem
Cited in
(84)- Approximation algorithms for geometric median problems
- On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre
- Location, pricing and the problem of Apollonius
- Bounded-hop communication networks
- A constant-factor approximation algorithm for the k-median problem
- Faster balanced clusterings in high dimension
- The traveling \(k\)-median problem: approximating optimal network coverage
- Lossy kernelization of same-size clustering
- A refined approximation for Euclidean \(k\)-means
- Linear-size universal discretization of geometric center-based problems in fixed dimensions
- Preclustering algorithms for imprecise points
- \(\mathrm{M}^p\)UFLP: universal facility location problem in the \(p\)-th power of metric space
- Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters
- Polynomial time approximation schemes for clustering in low highway dimension graphs
- On Euclidean vehicle routing with allocation
- Minimizing the sum of distances to a server in a constraint network
- Probabilistic k-median clustering in data streams
- Clustering with or without the approximation
- On the bounded-hop MST problem on random Euclidean instances
- Approximation schemes for node-weighted geometric Steiner tree problems
- A PTAS for the geometric connected facility location problem
- On the complexity of some problems of searching for a family of disjoint clusters
- A PTAS for the cardinality constrained covering with unit balls
- The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
- A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)
- Interactive clustering of linear classes and cryptographic lower bounds
- An approximation algorithm for the continuous k-medians problem in a convex polygon
- New approximation algorithms for the unsplittable capacitated facility location problem
- An improved competitive algorithm for one-dimensional incremental median problem
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design
- Sublinear‐time approximation algorithms for clustering via random sampling
- The two‐median problem on Manhattan meshes
- A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
- Clustering through continuous facility location problems
- A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem
- Approximation schemes for clustering problems
- Continuous reformulations and heuristics for the Euclidean travelling salesperson problem
- A streaming algorithm for k-means with approximate coreset
- Local search yields a PTAS for \(k\)-means in doubling metrics
- Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics
- Data stability in clustering: a closer look
- The Euclidean \(k\)-supplier problem
- Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension
- Efficient approximation schemes for uniform-cost clustering problems in planar graphs
- On the fixed-parameter tractability of capacitated clustering
- scientific article; zbMATH DE number 7561535 (Why is no real title available?)
- Approximating the distribution of the median and other robust estimators on uncertain data
- Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS
- Facility Location with Matroid or Knapsack Constraints
- A (1+\varepsilon)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
- Approximating k-median via pseudo-approximation
- Polynomial time approximation schemes for clustering in low highway dimension graphs
- A local search approximation algorithm for \(k\)-means clustering
- k-median: exact recovery in the extended stochastic ball model
- Incremental facility location problem and its competitive algorithms
- Hardness of approximation for Euclidean \(k\)-median
- Universal Algorithms for Clustering Problems
- Improved approximations for Euclidean k -means and k -median, via nested quasi-independent sets
- FPT Approximation for Constrained Metric k-Median/Means
- Clustering and the perturbed spatial median
- A Modern View on Stability of Approximation
- Lossy kernelization of same-size clustering
- Approximation algorithms for fair k-median problem without fairness violation
- A generalized k-means problem for clustering and an ADMM-based k-means algorithm
- Local search yields a PTAS for fixed-dimensional k-means problem with penalties
- A PTAS framework for clustering problems in doubling metrics
- Approximation algorithms for robust clustering problems using local search techniques
- FPT approximation for capacitated clustering with outliers
- Strategyproof mechanism for two heterogeneous facilities with constant approximation ratio
- Clustering under perturbation stability in near-linear time
- A gap-ETH-tight approximation scheme for Euclidean TSP
- Improved approximation algorithm for individual fairness k-median
- Local search algorithms for the red-blue median problem
- Online facility location with weights and congestion
- A PTAS for k-hop MST on the Euclidean plane: improving dependency on k
- Streaming algorithms for geometric Steiner forest
- Facility location models for distribution system design
- Better guarantees for individual fairness k-median
- Universal algorithms for clustering problems
- Dimension-free parameterized approximation schemes for hybrid clustering
- A QPTAS for facility location on unit disk graphs
- Center-based clustering under perturbation stability
- Approximating \(k\)-hop minimum spanning trees in Euclidean metrics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542527)
