A unified approach to approximation algorithms for bottleneck problems
Journal of the ACM (JACM)
A heuristic for the p-center problem in graphs
Discrete Applied Mathematics
Robust regression and outlier detection
Robust regression and outlier detection
Algorithms for clustering data
Algorithms for clustering data
Integer and combinatorial optimization
Integer and combinatorial optimization
Optimal algorithms for approximate clustering
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Approximation algorithms for geometric median problems
Information Processing Letters
A note on the prize collecting traveling salesman problem
Mathematical Programming: Series A and B
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximation schemes for Euclidean k-medians and related problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
A constant-factor approximation algorithm for the k-median problem (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Efficient randomized algorithms for the repeated median line estimator
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A practical approximation algorithm for the LMS line estimator
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Analysis of a local search heuristic for facility location problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Greedy strikes back: improved facility location algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The budgeted maximum coverage problem
Information Processing Letters
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A new greedy approach for facility location problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation Algorithms for Partial Covering Problems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Improved Approximation Algorithms for Multilevel Facility Location Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
A Greedy Facility Location Algorithm Analyzed Using Dual Fitting
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Proceedings of the nineteenth annual symposium on Computational geometry
Better streaming algorithms for clustering problems
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
Journal of the ACM (JACM)
Minimum spanning tree with hop restrictions
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Asymmetric k-center is log* n-hard to approximate
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A k-Median Algorithm with Running Time Independent of Data Size
Machine Learning
Approximation algorithms for partial covering problems
Journal of Algorithms
An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
Information Processing Letters
Asymmetric k-center is log* n-hard to approximate
Journal of the ACM (JACM)
A robust maximum completion time measure for scheduling
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A general approach for incremental approximation and hierarchical clustering
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Achieving anonymity via clustering
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Asymmetry in k-center variants
Theoretical Computer Science - Approximation and online algorithms
Improving voltage assignment by outlier detection and incremental placement
Proceedings of the 44th annual Design Automation Conference
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Model-driven optimization using adaptive probes
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Asymmetric k-center with minimum coverage
Information Processing Letters
A constant factor approximation algorithm for k-median clustering with outliers
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for clustering uncertain data
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Facility Location Problems: A Parameterized View
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Effective spatial clustering methods for optimal facility establishment
Intelligent Data Analysis
Exceeding expectations and clustering uncertain data
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
EDISKCO: energy efficient distributed in-sensor-network k-center clustering with outliers
Proceedings of the Third International Workshop on Knowledge Discovery from Sensor Data
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Kernel Methods in Computer Vision
Foundations and Trends® in Computer Graphics and Vision
Incremental improvement of voltage assignment
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
Information Processing Letters
Approximation algorithm for the kinetic robust K-center problem
Computational Geometry: Theory and Applications
Achieving anonymity via clustering
ACM Transactions on Algorithms (TALG)
Analysing the influence of vertex clustering on PCA-based dynamic mesh compression
AMDO'10 Proceedings of the 6th international conference on Articulated motion and deformable objects
Online network design with outliers
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Budgeted red-blue median and its generalizations
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
An Extension of the Nemhauser-Trotter Theorem to Generalized Vertex Cover with Applications
SIAM Journal on Discrete Mathematics
Facility location problems: A parameterized view
Discrete Applied Mathematics
Sustainable biomass power plant location in the Italian Emilia-Romagna region
ACM Transactions on Intelligent Systems and Technology (TIST)
A unified framework for approximating and clustering data
Proceedings of the forty-third annual ACM symposium on Theory of computing
Compressive sensing with local geometric features
Proceedings of the twenty-seventh annual symposium on Computational geometry
Approximation algorithm for the uniform bounded facility problem
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Implicit branching and parameterized partial cover problems
Journal of Computer and System Sciences
Storage planning and replica assignment in content-centric publish/subscribe networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization Problems
ACM Transactions on Algorithms (TALG)
A General Approach for Incremental Approximation and Hierarchical Clustering
SIAM Journal on Computing
A maximum profit coverage algorithm with application to small molecules cluster identification
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Black-box reductions for cost-sharing mechanism design
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Data reduction for weighted and outlier-resistant clustering
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Min sum clustering with penalties
ESA'05 Proceedings of the 13th annual European conference on Algorithms
An improved approximation algorithm for uncapacitated facility location problem with penalties
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Inventory and facility location models with market selection
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
A primal-dual approximation algorithm for partial vertex cover: making educated guesses
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Extension of the nemhauser and trotter theorem to generalized vertex cover with applications
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Improved approximation algorithms for multilevel facility location problems
Operations Research Letters
Approximation Algorithms for Capacitated Location Routing
Transportation Science
Theoretical Computer Science
Matroid and knapsack center problems
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Diversity maximization under matroid constraints
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Learning Big (Image) Data via Coresets for Dictionaries
Journal of Mathematical Imaging and Vision
Approximation algorithm for uniform bounded facility location problem
Journal of Combinatorial Optimization
An Efficient Approach for Solving Reliable Facility Location Models
INFORMS Journal on Computing
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
Facility location problems are traditionally investigated with the assumption that all the clients are to be provided service. A significant shortcoming of this formulation is that a few very distant clients, called outliers, can exert a disproportionately strong influence over the final solution. In this paper we explore a generalization of various facility location problems (K-center, K-median, uncapacitated facility location etc) to the case when only a specified fraction of the customers are to be served. What makes the problems harder is that we have to also select the subset that should get service. We provide generalizations of various approximation algorithms to deal with this added constraint.