AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
From MaRDI portal
Publication:4216137
DOI10.1006/jagm.1997.0921zbMath0917.68201OpenAlexW4255776112MaRDI QIDQ4216137
Rina Panigrahy, Sundar Vishwanathan
Publication date: 2 December 1998
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1997.0921
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (17)
A simple greedy approximation algorithm for the minimum connected \(k\)-center problem ⋮ Asymmetric \(k\)-center with minimum coverage ⋮ Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs ⋮ Min-Max-Min Optimization with Smooth and Strongly Convex Objectives ⋮ Structural parameters, tight bounds, and approximation for \((k, r)\)-center ⋮ The Euclidean k-Supplier Problem ⋮ Client assignment problems for latency minimization ⋮ The connected \(p\)-center problem on block graphs with forbidden vertices ⋮ Ant colony optimization for finding medians of weighted graphs ⋮ Discrete sensor placement problems in distribution networks ⋮ Asymmetry in \(k\)-center variants ⋮ Insertion heuristics for central cycle problems ⋮ Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs ⋮ Approximating Distance Measures for the Skyline ⋮ Unnamed Item ⋮ The weighted \(k\)-center problem in trees for fixed \(k\) ⋮ Efficiently computing succinct trade-off curves
This page was built for publication: AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
