http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
Arora, S. American Mathematical Society 1997 p.1-2
Differential greedy for the 0-1 equicut problem
Battiti, R.; Bertossi, A. American Mathematical Society 1997 p.3-22
Gradient-constrained minimal Steiner trees
Brazil, M.; Thomas, D. A.; Weng, J. F. American Mathematical Society 1997 p.23-38
The Steiner tree problem for terminals on the boundary of a rectilinear polygon
Cheng, S.-W. American Mathematical Society 1997 p.39-58
Using Hadwiger numbers in network design
Cieslik, D. American Mathematical Society 1997 p.59-78
Reducing the graphical Steiner problem with a sensitivity test
Duin, C. American Mathematical Society 1997 p.79-108
A frequency assignment problem in cellular phone networks
Eisenblaetter, A. American Mathematical Society 1997 p.109-116
An optimal greedy algorithm for wavelength allocation in directed tree networks
Erlebach, T.; Jansen, K.; Kaklamanis, C.; Persiano, P. American Mathematical Society 1997 p.117-130
A GRASP algorithm for the single source uncapacitated minimum concave-cost network flow problem
Holmqvlst, K.; Migdalas, A.; Pardalos, P. M. American Mathematical Society 1997 p.131-142
Approximation results for the optimum cost chromatic partition problem
Jansen, K. American Mathematical Society 1997 p.143-168