On min-max \(r\)-gatherings
From MaRDI portal
Publication:627109
DOI10.1016/j.tcs.2010.04.040zbMath1207.90069OpenAlexW2130762182MaRDI QIDQ627109
Publication date: 21 February 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.04.040
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
On approximating (connected) 2-edge dominating set by a tree ⋮ On r-Gatherings on the Line ⋮ A linear time algorithm for the \(r\)-gathering problem on the line ⋮ r-Gatherings on a star and uncertain r-gatherings on a line ⋮ \(r\)-gathering problems on spiders: hardness, FPT algorithms, and PTASes ⋮ On Approximating (Connected) 2-Edge Dominating Set by a Tree ⋮ Clustering with lower-bounded sizes. A general graph-theoretic framework ⋮ Online facility assignment ⋮ Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers ⋮ Assigning Proximity Facilities for Gatherings ⋮ A Simple Algorithm for $r$-gatherings on the Line ⋮ Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clustering to minimize the maximum intercluster distance
- Fast approximate PCPs
- Achieving anonymity via clustering
- Facility Location on a Sphere
- Greedy Strikes Back: Improved Facility Location Algorithms
- Local Search Heuristics for k-Median and Facility Location Problems
- Region-Restricted Clustering for Geographic Data Mining
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Integer Programming and Combinatorial Optimization
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
