منابع مشابه
Simple cubic graphs with no short traveling salesman tour
Let tsp(G) denote the length of a shortest travelling salesman tour in a graph G. We prove that for any ε > 0, there exists a simple 2-connected planar cubic graph G1 such that tsp(G1) ≥ (1.25 − ε) · |V (G1)|, a simple 2-connected bipartite cubic graph G2 such that tsp(G2) ≥ (1.2 − ε) · |V (G2)|, and a simple 3-connected cubic graph G3 such that tsp(G3) ≥ (1.125− ε) · |V (G3)|.
متن کامل1 REMARKS ON THE PARTICLE VERB DOMAINS Satoshi Oku
Particle verbs have challenged linguistic analysis because of their unique and sometimes contradictory characteristics. A verb particle combination behaves like a complex V 0 in some respects. For instance, on the one hand, the semantics of look up (the information) is not compositionally transparent and thus must be stored in the lexicon. Some morphosyntactic properties also indicate that a pa...
متن کاملTraveling Waves in 2d Reactive Boussinesq Systems with No-slip Boundary Conditions
We consider systems of reactive Boussinesq equations in two dimensional strips that are not aligned with gravity’s direction. We prove that for any width of such strips and for arbitrary Rayleigh and Prandtl numbers, the systems admit smooth, non-planar traveling wave solutions with the fluid’s velocity satisfying no-slip boundary conditions.
متن کاملMathematical Programming Manuscript No. Traveling Salesman Games with the Monge Property ?
Several works indicate the relationship between well-solved combinatorial optimization problems and the core non-emptiness of cooperative games associated with them. In this paper, we consider the core of symmetric traveling salesman games and relate it with well-solved cases of traveling salesman problems. We show that the core of a traveling salesman game in which the distance matrix is a sym...
متن کاملNo-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem
In this paper we study the classical no-wait flowshop scheduling problem with makespan objective (F |no−wait|Cmax in the standard three-field notation). This problem is well-known to be a special case of the asymmetric traveling salesman problem (ATSP) and as such has an approximation algorithm with logarithmic performance guarantee. In this work we show a reverse connection, we show that any p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Research Society of Buddhism and Cultural Heritage
سال: 2010
ISSN: 0919-6943,2186-3253
DOI: 10.5845/bukkyobunka.2010.19_l1