Distributed Approximations for Packing in Unit-Disk Graphs

DOI10.1007/978-3-540-75142-7_14zbMATH Open1145.68587OpenAlexW1515054115MaRDI QIDQ3523205FDOQ3523205

Authors: Andrzej Czygrinow, Michal Hanckowiak 

Publication date: 2 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75142-7_14

Recommendations

• Distributed Approximation Algorithms in Unit-Disk Graphs
• Efficient independent set approximation in unit disk graphs
• Graph-Theoretic Concepts in Computer Science
• Approximation Algorithms for Domatic Partitions of Unit Disk Graphs
• Publication:4504025

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Distributed algorithms (68W15)

Cited In (3)

• Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
• Distributed Approximation Algorithms in Unit-Disk Graphs
• Perfectness and imperfectness of unit disk graphs on triangular lattice points

This page was built for publication: Distributed Approximations for Packing in Unit-Disk Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3523205)