NobleBlocks
Public

Unit disk graph approximation

Published • Oct 1, 2004
NobleIDNI2P20W70R95S81
Authors:
Fabian Kühn
,
Thomas Moscibroda
,
Rogert Wattenhofer

Abstract

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. In wireless ad hoc and sensor networks, such an embedding can be used to obtain virtual coordinates. In this paper, we prove a non-approximability result f...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!