par Fiorini, Samuel ;Joret, Gwenaël ;Cardinal, Jean
Référence Operations research letters, 36, page (680-683)
Publication Publié, 2008
Article révisé par les pairs
Résumé : We study graph orientations that minimize the entropy of the in-degree sequence. We prove that the minimum entropy orientation problem is NP-hard even if the graph is planar, and that there exists a simple linear-time algorithm that returns an approximate solution with an additive error guarantee of 1 bit. © 2008 Universite Libre de Bruxelles, Belgium.

Documents en relation

DI-fusion