排序方式: 共有4条查询结果,搜索用时 15 毫秒
1
1.
We consider an -hard variant (Δ-Max-ATSP) and an -hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a -approximation algorithm for Δ-Max-ATSP and a -approximation algorithm for Max-3-DCC with polynomial running time. The results are obtained via a new way of applying techniques for computing undirected cycle covers to directed problems. 相似文献
2.
3.
Ge Lin Siming Meng Ruomei Wang Xiaonan Luo Yi Li 《Journal of Computational and Applied Mathematics》2011,236(5):980-987
To establish the human body model to analyze the heat and moisture transfer on body surface, a new explicit definition of rational L-recursion surface is given and the L-recursion surfaces, in Grassmann spaces, are constructed by using blossom method of the homogeneous normal pyramid form. Based on our human body model, the balance theory of garment simulation, the heat and moisture transfer balance equations, called ICAD-balance equations are obtained. The balance theory of garment simulation integrally studies the complex system of human body-fabric-environment. At the same time, the method of obtaining the heat and moisture transfer balance equations is also based on the mass conservation law, the energy conservation law and the Fish law of capillarity. A finite volume method is employed to solve the ICAD-balance equations. 相似文献
4.
1. IntroductionLet fi C mZ be a closed simply connected polygonal region, andA:~ {fit}!=,, fi = .6 fitz= 1its regular triangulation, i.e. the trianglesfit, ioj, i / i,can have in common only a vertex or a whole edge. Let V de'note the set of innervenices, E the set of inner edges, and E the set of all edges of a. PutmV:= IVI, mE:~ IEI.The planar graph G:~ (V, E) clearly describes A. However, it's sometimes useful toconsider also the dual planar graph Q:= (V,e), where venices i E V co… 相似文献
1