Algorithms for facility location problems with outliers. (Extended abstract)
From MaRDI portal
Recommendations
- An approximation algorithm for the dynamic facility location problem with outliers
- Squared metric facility location problem with outliers
- An approximation algorithm for the k-level facility location problem with outliers
- scientific article; zbMATH DE number 1559542
- scientific article; zbMATH DE number 1670526
Cited in
(only showing first 100 items - show all)- An improved approximation algorithm for uncapacitated facility location problem with penalties
- An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
- Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions
- An approximation algorithm for the \(k\)-median problem with uniform penalties via pseudo-solution
- Black-box reductions for cost-sharing mechanism design
- Approximation algorithms for the robust facility leasing problem
- Improved approximation algorithms for multilevel facility location problems
- Local search algorithm for the squared metric \(k\)-facility location problem with linear penalties
- Approximation algorithm for the partial set multi-cover problem
- A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties
- Approximating the \(\tau\)-relaxed soft capacitated facility location problem
- Local search algorithm for the spherical \(k\)-means problem with outliers
- Improved approximation for prize-collecting red-blue median
- An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties
- An approximation algorithm for the k-level facility location problem with outliers
- On the power of static assignment policies for robust facility location problems
- Near-optimal clustering in the \(k\)-machine model
- An approximation algorithm for the spherical k-means problem with outliers by local search
- Improved approximation algorithms for solving the squared metric k-facility location problem
- Approximation and complexity of the capacitated geometric median problem
- Concave connection cost facility location and the star inventory routing problem
- A technique for obtaining true approximations for \(k\)-center with covering constraints
- Fair colorful \(k\)-center clustering
- A cost-sharing scheme for the \(k\)-level facility location game with penalties
- An improved approximation algorithm for squared metric \(k\)-facility location
- Algorithms for covering multiple submodular constraints and applications
- Approximation algorithms for clustering with dynamic points
- Group parking permit problems
- Parallel approximation for partial set cover
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
- Facility location problems: a parameterized view
- Approximation algorithms for the covering-type \(k\)-violation linear program
- The incremental connected facility location problem
- Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties
- An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties
- Asymmetric \(k\)-center with minimum coverage
- A primal-dual approximation algorithm for partial vertex cover: Making educated guesses
- Approximation algorithm for uniform bounded facility location problem
- Local search approximation algorithms for the k-means problem with penalties
- An approximation algorithm for the dynamic facility location problem with outliers
- Approximation algorithms for the fault-tolerant facility location problem with penalties
- On the complexity of some problems of searching for a family of disjoint clusters
- Improved approximation algorithm for universal facility location problem with linear penalties
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- Asymmetry in \(k\)-center variants
- Learning big (image) data via coresets for dictionaries
- Improved approximation algorithm for k-level uncapacitated facility location problem (with penalties)
- A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks
- On some variants of Euclidean \(k\)-supplier
- Better guarantees for \(k\)-median with service installation costs
- Tight FPT approximation for constrained k-center and k-supplier
- New approximation results for resource replication problems
- Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique
- Combinatorial approximation algorithms for the robust facility location problem with penalties
- Approximation Algorithms for the Robust Facility Location Problem with Penalties
- An Approximation Algorithm for the k-Median Problem with Uniform Penalties via Pseudo-Solutions
- Approximation algorithm for the uniform bounded facility problem
- Online network design with outliers
- From cost sharing mechanisms to online selection problems
- Local search algorithms for \(k\)-median and \(k\)-facility location problems with linear penalties
- A $$(5.83+\epsilon )$$ ( 5.83 + ϵ ) -Approximation Algorithm for Universal Facility Location Problem with Linear Penalties
- Facility Location Problems: A Parameterized View
- An Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem with Penalties
- An approximation algorithm for the risk-adjusted two-stage stochastic facility location problem with penalties
- An approximation algorithm for the dynamic facility location problem with submodular penalties
- Mathematical programming models for determining the optimal location of beehives
- Helly-type theorems in property testing
- Approximation algorithm for resource allocation problems with time dependent penalties
- Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach
- A cost-sharing method for an uncapacitated facility location game with penalties
- A Lottery Model for Center-Type Problems With Outliers
- Generalized center problems with outliers
- A lottery model for center-type problems with outliers
- Generalized center problems with outliers
- Privacy preserving clustering with constraints
- Low rank approximation in the presence of outliers
- scientific article; zbMATH DE number 7378621 (Why is no real title available?)
- A technique for obtaining true approximations for k-center with covering constraints
- Fair colorful k-center clustering
- An improved primal-dual approximation algorithm for the k-means problem with penalties
- Local search algorithm for universal facility location problem with linear penalties
- A constant approximation for colorful k-center
- Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction
- Large-scale distributed algorithms for facility location with outliers
- Robust communication-optimal distributed clustering algorithms
- Discrete facility location in machine learning
- Squared metric facility location problem with outliers
- Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
- Supply chain management with online customer selection
- Black-box reductions for cost-sharing mechanism design
- Data reduction for weighted and outlier-resistant clustering
- Approximation algorithms for clustering with dynamic points
- On the cost of essentially fair clusterings
- Small Space Stream Summary for Matroid Center
- scientific article; zbMATH DE number 7650100 (Why is no real title available?)
- Robust \(k\)-center with two types of radii
- Robust \(k\)-center with two types of radii
- Generalized \(k\)-center: distinguishing doubling and highway dimension
- Effective Heuristic Techniques for Combined Robust Clustering Problem
- A capacitated biobjective location problem with uniformly distributed demands in the UAV‐supported delivery operation
This page was built for publication: Algorithms for facility location problems with outliers. (Extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768359)
