Algorithms and Computation
From MaRDI portal
Publication:5712150
DOI10.1007/b104582zbMath1116.68680OpenAlexW2491382297MaRDI QIDQ5712150
Binhai Zhu, Sergey Bereg, Ming-Hui Jiang, Zhongping Qin
Publication date: 22 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b104582
Programming involving graphs or networks (90C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items
A new approximation algorithm for labeling points with circle pairs, The dispersive art gallery problem, Approximation algorithms for free-label maximization, Matching points with rectangles and squares, Dispersion in disks
