Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks

DOI10.1016/J.JPDC.2005.10.007zbMath1096.68784OpenAlexW2140936100MaRDI QIDQ2497720

Yu Wang, Xiang-Yang Li

Publication date: 4 August 2006

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2005.10.007

zbMATH Keywords

independent setdisk graphsvertex coloringvertex coverPTASwireless ad hoc networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (3)

PTAS for minimum weighted connected vertex cover problem with \(c\)-local condition in unit disk graphs ⋮ PTAS for connected vertex cover in unit disk graphs ⋮ Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph

This page was built for publication: Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks