---
res:
  bibo_abstract:
  - "We consider the problem of dominating set-based virtual backbone used for\r\nrouting
    in asymmetric wireless ad-hoc networks. These networks have non-uniform\r\ntransmission
    ranges and are modeled using the well-established disk graphs. The\r\ncorresponding
    graph theoretic problem seeks a strongly connected\r\ndominating-absorbent set
    of minimum cardinality in a digraph. A subset of nodes\r\nin a digraph is a strongly
    connected dominating-absorbent set if the subgraph\r\ninduced by these nodes is
    strongly connected and each node in the graph is\r\neither in the set or has both
    an in-neighbor and an out-neighbor in it.\r\nDistributed algorithms for this problem
    are of practical significance due to\r\nthe dynamic nature of ad-hoc networks.
    We present a first distributed\r\napproximation algorithm, with a constant approximation
    factor and O(Diam)\r\nrunning time, where Diam is the diameter of the graph. Moreover
    we present a\r\nsimple heuristic algorithm and conduct an extensive simulation
    study showing\r\nthat our heuristic outperforms previously known approaches for
    the problem.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: 'Faisal N. '
      foaf_name: 'Abu-Khzam, Faisal N. '
      foaf_surname: Abu-Khzam
  - foaf_Person:
      foaf_givenName: Christine
      foaf_name: Markarian, Christine
      foaf_surname: Markarian
      foaf_workInfoHomepage: http://www.librecat.org/personId=37612
  - foaf_Person:
      foaf_givenName: Friedhelm
      foaf_name: Meyer auf der Heide, Friedhelm
      foaf_surname: Meyer auf der Heide
      foaf_workInfoHomepage: http://www.librecat.org/personId=15523
  - foaf_Person:
      foaf_givenName: Michael
      foaf_name: Schubert, Michael
      foaf_surname: Schubert
  dct_date: 2015^xs_gYear
  dct_language: eng
  dct_title: Approximation and Heuristic Algorithms for Computing Backbones in  Asymmetric
    Ad-Hoc Networks@
...