Ta Anh Son

Learn More
Car pooling problem (CPP) is a well known transport solution that consists in sharing a car between a driver and passengers sharing the same route, or part of it. The challenge is to minimize both the number of required cars and the additional cost in terms of time for the drivers. There are two resulting problems that are interdependent and NP-complete:(More)
MULTICAST gives an efficient way to transfer data from a source to all the member of a multicast group. The Multicast Quality of Service (QoS) routing problem consists in finding a set of paths from a source node to its multicast group satisfying the QoS requirements. This problem is known as one of the key problems in network optimization field. In this(More)
Car pooling is a well known transport solution that consists in sharing a car between a driver and passengers sharing the same route, or part of it. The challenge is to minimize both the number of required cars and the additional cost in terms of time for the drivers. There are two resulting problems that are interdependent and NP-complete: assigning(More)
The Multicast Quality of Service (QoS) routing emphasizes to find a set of paths from a source node to a destination node set satisfying the QoS requirements. In this paper, we consider the two problems in Multicast QoS Routing called the MCM (Multi-Constrained Mutlicast Tree) and the MCOM (Multi-Constrained Optimal Multicast Tree). They are all NP-complete(More)
  • 1