A concentration inequality for the facility location problem
From MaRDI portal
Publication:2670506
DOI10.1016/j.orl.2022.01.009OpenAlexW3112813701MaRDI QIDQ2670506
Publication date: 11 March 2022
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.04488
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioning heuristics for two geometric maximization problems
- On random minimum length spanning trees
- On the value of a random minimum spanning tree problem
- On Frieze's \(\zeta\) (3) limit for lengths of minimal spanning trees
- The average-case analysis of some on-line algorithms for bin packing
- On the solutions of stochastic traveling salesman problems
- Random minimum length spanning trees in regular graphs
- A probabilistic analysis of the capacitated facility location problem
- A note on random minimum length spanning trees
- Further results on the probabilistic traveling salesman problem
- Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold
- The threshold for random k-SAT is 2 k (ln 2 - O(k))
- Euclidean matching problems and the metropolis algorithm
- A stochastic model of bin-packing
- The Travelling Salesman Problem and Minimum Matching in the Unit Square
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
- A Concentration Inequality for the K-Median Problem
- The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph
- On the Length of a Random Minimum Spanning Tree
- A Better Algorithm for Random k-SAT
- Automata, Languages and Programming
This page was built for publication: A concentration inequality for the facility location problem
