Distributed Approximation Algorithms in Unit-Disk Graphs

DOI10.1007/11864219_27MaRDI QIDQ3524320zbMATH OpenOpenAlexFDO

Authors Andrzej Czygrinow, Michal Hanckowiak

Publication date 9 September 2008

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

Full work available at URL https://doi.org/10.1007/11864219_27

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Distributed algorithms (68W15)

Recommendations

• Distributed Approximations for Packing in Unit-Disk Graphs
• Approximation Algorithms for Domatic Partitions of Unit Disk Graphs
• Graph-Theoretic Concepts in Computer Science
• A (4 + ε)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs
• Distributed Approximation Algorithms for Planar Graphs

Cited in

(10)

• Near-optimal distributed DFS in planar graphs
• Distributed Approximation Algorithm for Resource Clustering
• Fast Distributed Approximations in Planar Graphs
• Distributed Approximations for Packing in Unit-Disk Graphs
• Graph-Theoretic Concepts in Computer Science
• Distributed Approximation Algorithms for Planar Graphs
• A Local Distributed Algorithm to Approximate MST in Unit Disc Graphs
• Optimal distributed algorithms in unlabeled tori and chordal rings
• Approximation algorithms for maximum matchings in geometric intersection graphs
• Distributed MST for constant diameter graphs

This page was built for publication: Distributed Approximation Algorithms in Unit-Disk Graphs

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