scientific article; zbMATH DE number 7121835
From MaRDI portal
Publication:5240127
DOI10.4230/OASIcs.ATMOS.2014.25zbMath1432.90075MaRDI QIDQ5240127
Joseph S. B. Mitchell, Esther M. Arkin, Michael Segal, Paz Carmi, Matthew J. Katz
Publication date: 24 October 2019
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20) Discrete location and assignment (90B80) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Cites Work
- Minimum connected dominating sets and maximal independent sets in unit disk graphs
- Unit disk graphs
- Classes of graphs which approximate the complete Euclidean graph
- Geometric Spanner Networks
- Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks
- ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS
- Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- Simple heuristics for unit disk graphs
- Polynomial-time Construction of Contraction Hierarchies for Multi-criteria Objectives
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
This page was built for publication:
