The hardness of routing two pairs on one face (2008)
We prove the NP-completeness of the integer multiflow problem in planar graphs, with the following restrictions: there are only two edges of demand, both lying on the infinite face of the routing...
Multiflow Feasibility: an Annotated Tableau (2008)
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...
The hardness of routing two pairs on one face (2008)
We prove the NP-completeness of the integer multiflow problem in planar graphs, with the following restrictions: there are only two edges of demand, both lying on the infinite face of the routing...
Multiflow Feasibility: an Annotated Tableau (2008)
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...
Brauner, Nadia, Naves, Guyslain
We consider a scheduling problem that arises from an industrial application in chemical experimentations, where a single machine can process a fixed number of compatible jobs simultaneously. The...
Brauner, Nadia, Naves, Guyslain
We consider a scheduling problem that arises from an industrial application in chemical experimentations, where a single machine can process a fixed number of compatible jobs simultaneously. The...