The Euclidean \(k\)-supplier problem in \(I R^2\)

DOI10.1016/j.orl.2020.10.008OpenAlexW3105505676WikidataQ114143890 ScholiaQ114143890MaRDI QIDQ2661589

Gautam K. Das, Manjanna Basappa, Subhas C. Nandy, Ramesh K. Jallu

Publication date: 7 April 2021

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2020.10.008

zbMATH Keywords

approximation algorithmlocal searchfixed parameter tractabilityVoronoi diagram\(k\)-supplier

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Base station placement on boundary of a convex polygon
• Constrained \(k\)-center and movement to independence
• Clustering to minimize the maximum intercluster distance
• Exact and approximation algorithms for clustering
• The Euclidean \(k\)-supplier problem in \(\mathbb R^2\)
• The mixed center location problem
• A theory and algorithms for combinatorial reoptimization
• Some variations on constrained minimum enclosing circle problem
• An approximation algorithm for \(k\)-center problem on a convex polygon
• The searching over separators strategy to solve some NP-hard problems in subexponential time
• Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
• VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION
• A Best Possible Heuristic for the k-Center Problem
• The Euclidean k-Supplier Problem
• Approximating k-center in planar graphs
• Constrained k-Center Problem on a Convex Polygon

This page was built for publication: The Euclidean \(k\)-supplier problem in \(I R^2\)