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

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.
International Symposium on Operations Research (OR 99)
MAGDEBURG, GERMANY
SEP 01-03, 1999
German Operat Res Soc, Magdeburg Fac Econ & Management
Rilevanza internazionale
Settore MAT/09 - Ricerca Operativa
eng
Intervento a convegno
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.
Confessore, G; Dell'Olmo, P; Giordani, S
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.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/2108/52236
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 0
social impact