Let G be a complete directed graph with n vertices and integer edge weights in range [0,M ]. It is well known that an optimal Traveling Salesman Problem (TSP) in G can be solved in 2 time and space (all bounds are given within a polynomial factor of the input length, i.e., poly(n, logM)) and this is still the fastest known algorithm. If we allow a polynomial space only, then the best known algo...

Mitoxantrone (MIT) is an anticancer agent with photosensitive properties that is commonly used in various cancers. Multidrug resistance (MDR) effect has been an obstacle to using MIT for cancer therapy. Photochemical internalization, on account of photodynamic therapy, has been applied to improve the therapeutic effect of cancers with MDR effect. In this study, an MIT-poly(ε-caprolactone)-pluro...