Results 231 to 240 of about 182,746 (274)
Some of the next articles are maybe not open access.
The Kth TSP is pseudopolynomial when TSP is polynomial
Discrete Mathematics, Algorithms and Applications, 2018Given an undirected graph [Formula: see text] with a weight function [Formula: see text], and a positive integer [Formula: see text], the Kth Traveling Salesman Problem (Kth TSP) is to find [Formula: see text] Hamilton cycles [Formula: see text] such that, for any Hamilton cycle [Formula: see text], we have [Formula: see text]. This problem is NP-hard
openaire +1 more source
TSP-1, TSP-2, and TSP-5 demonstrate sexual dimorphism in intimal hyperplasia in rats and mice
American Journal of Physiology-Heart and Circulatory PhysiologyThrombospondins (TSPs) are matricellular proteins involved in intimal hyperplasia (IH). We demonstrate in vitro, TSP-1, TSP-2, and TSP-5 affect one another and influence vascular smooth muscle cell proliferation and migration. In vivo, using a rat and mouse model of IH, we show that TSPs demonstrate a sexual dimorphism that may explain differences ...
Ashley A. Peters +7 more
openaire +2 more sources
On Applying Methods for Graph-TSP to Metric TSP
2016The Metric Travelling Salesman Problem, henceforth metric TSP, is a fundamental problem in combinatorial optimization which consists of finding a minimum cost Hamiltonian cycle (also called a TSP tour) in a weighted complete graph in which the costs are metric. Metric TSP is known to belong to a class of problems called NP-hard even in the special case
openaire +2 more sources