Unit Disk Graph Approximation
- Fabian Kuhn ,
- Thomas Moscibroda ,
- Roger Wattenhofer
DIALM-POMC 2004: ACM Joint Workshop on Foundations of Mobile Computing, Philadelphia, Pennsylvania, USA |
Finding a good embedding of a unit disk graph given by its connectivity information is a problem of practical importance in a variety of fields. (See attached for rest of abstract and mathematical formulas.)