Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    On the approximability of the Steiner tree problem in phylogeny

    Three results on the Steiner tree problem are presented: (i) Computing optimum k-restricted Steiner tree is APX-complete for k≥4, (ii) the minimum-cost k-restricted Steiner tree problem in phylogeny is APX-comple...

    David Fernández-Baca, Jens Lagergren in Algorithms and Computation (1996)

  2. No Access

    Chapter and Conference Paper

    Space-sweep algorithms for parametric optimization

    David Fernández-Baca in SWAT 90 (1990)

  3. No Access

    Chapter and Conference Paper

    On matroids and hierarchical graphs

    David Fernández-Baca, Mark A. Williams in SWAT 90 (1990)