conference paper
Optimal subtrees and extensions
1982
Bonn Workshop on Combinatorial Optimization
We consider the problem of finding an optimal family of nested rooted subtrees of a tree. We give a linear algorithm for the associated 1.p. for this problem. A generalization of this problem is that of finding an optimal "lower closed set" of nodes in an acyclic graph for which polyhedral and polarity characterization are given. these problem are useful relaxations when solving more complicated sequencing problems.
Type
conference paper
Author(s)
Date Issued
1982
Published in
Bonn Workshop on Combinatorial Optimization
Series title/Series vol.
Annals of Discrete Mathematics; 16
Start page
121
End page
127
Note
PRO 82.01
Editorial or Peer reviewed
REVIEWED
Written at
EPFL
EPFL units
| Event name | Event date |
28-30 August 1980 | |
Available on Infoscience
February 13, 2006
Use this identifier to reference this record