Multiflow Feasibility : an Annotated Tableau
Résumé
We provide a tableau of 189 entries and some annotations presenting the computational complexity of integer multiflow feasibility problems; 21 entries remain open. The tableau is followed by an introduction to the field, providing more problems, reproving some results with new insights, simple proofs, or slight sharpenings motivated by the tableau, paying particular attention to planar (di)graphs with terminals on the boundary. Last, the key-theorems and key-problems of the tableau are listed.
Domaines
Mathématique discrète [cs.DM]
Origine : Fichiers produits par l'(les) auteur(s)