A 116/13-approximation algorithm for \(L(2,1)\)-labeling of unit disk graphs

DOI10.1007/978-3-030-10801-4_30zbMath1444.68152OpenAlexW2909208954MaRDI QIDQ2206246

Hirotaka Ono, Hisato Yamanaka

Publication date: 22 October 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-10801-4_30

zbMATH Keywords

graph algorithmapproximation algorithmchannel assignmentfrequency assignment\(L(2,1)\)-labelingunit-disk graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs

This page was built for publication: A 116/13-approximation algorithm for \(L(2,1)\)-labeling of unit disk graphs