In this paper we acyclic orient dart-free clique-Helly chordal graphs in which each directed path is contained in at most two maximal cliques. As shown by the authors in previous works, this allows to give performance guarantee approximation results on a wide class of optimization problems.
Confessore, G., Dell'Olmo, P., Giordani, S. (2000). Orienting dart-free clique-Helly chordal graphs. In OPERATIONS RESEARCH PROCEEDINGS 1999 (pp.52-57). BERLIN : SPRINGER-VERLAG BERLIN.
Orienting dart-free clique-Helly chordal graphs
GIORDANI, STEFANO
2000-01-01
Abstract
In this paper we acyclic orient dart-free clique-Helly chordal graphs in which each directed path is contained in at most two maximal cliques. As shown by the authors in previous works, this allows to give performance guarantee approximation results on a wide class of optimization problems.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
