On Min-Max r-Gatherings

DOI10.1007/978-3-540-77918-6_11zbMath1130.90353OpenAlexW2180193454MaRDI QIDQ5443378

Amitai Armon

Publication date: 20 February 2008

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77918-6_11

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (1)

Mobile facility location: combinatorial filtering via weighted occupancy

Cites Work

• Clustering to minimize the maximum intercluster distance
• Fast approximate PCPs
• Achieving anonymity via clustering
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Min-Max r-Gatherings