Easy and hard bottleneck location problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3503127 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- Bottleneck extrema
- P-Complete Approximation Problems
- Scheduling to Minimize Interaction Cost
Cited in
(61)- New algorithms for fair \(k\)-center problem with outliers and capacity constraints
- Mind the gap: edge facility location problems in theory and practice
- Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making
- Improved approximation algorithms for capacitated fault-tolerant \(k\)-center
- The ordered \(k\)-median problem: surrogate models and approximation algorithms
- Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs
- Generalized center problems with outliers
- Fixed parameter approximations for \(k\)-center problems in low highway dimension graphs
- A constant approximation for colorful \(k\)-center
- A technique for obtaining true approximations for \(k\)-center with covering constraints
- Fair colorful \(k\)-center clustering
- Location of rectilinear center trajectories
- A technique for obtaining true approximations for \(k\)-center with covering constraints
- Fair colorful \(k\)-center clustering
- Obstructions to a small hyperbolicity in Helly graphs
- Approximability results for the $p$-centdian and the converse centdian problems
- A new compact formulation for the discrete p-dispersion problem
- Special issue on Locational analysis
- A simple heuristic for the p-centre problem
- Graph theory (algorithmic, algebraic, and metric problems)
- Small Space Stream Summary for Matroid Center
- The fault-tolerant capacitated \(K\)-center problem
- Kinetic clustering of points on the line
- Improved separated red-blue center clustering
- Approximability results for the converse connected \(p\)-centre problem
- Approximation algorithms for clustering with dynamic points
- On the cost of essentially fair clusterings
- Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem
- Combinatorial analysis (nonnegative matrices, algorithmic problems)
- Fault tolerant \(K\)-center problems
- scientific article; zbMATH DE number 4066949 (Why is no real title available?)
- A heuristic for the p-center problem in graphs
- \(k\)-center problems with minimum coverage
- Approximating the probabilistic \(p\)-center problem under pressure
- Connected \(k\)-center and \(k\)-diameter clustering
- Analytical models for locating undesirable facilities
- Recent developments in approximation algorithms for facility location and clustering problems
- Facility location with dynamic distance functions
- Generalized center problems with outliers
- A lottery model for center-type problems with outliers
- On clustering with discounts
- Asymmetric \(k\)-center with minimum coverage
- Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs
- Insertion heuristics for central cycle problems
- On worst-case aggregation analysis for network location problems
- Locational analysis
- Clustering with faulty centers
- A Lottery Model for Center-Type Problems With Outliers
- Graph clustering
- The distributed algorithms for the lower-bounded \(k\)-center clustering in metric space
- Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints
- On interval and circular-arc covering problems
- The weighted \(k\)-center problem in trees for fixed \(k\)
- Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs
- scientific article; zbMATH DE number 4045779 (Why is no real title available?)
- Reverse greedy is bad for \(k\)-center
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs
- Privacy preserving clustering with constraints
- Stateless Information Dissemination Algorithms
- An adaptive probabilistic algorithm for online \(k\)-center clustering
- Client assignment problems for latency minimization
This page was built for publication: Easy and hard bottleneck location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1135201)
