Last update: Sat Oct 14 02:56:46 MDT 2017
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Li:1997:STS,
author = "Keqin Li",
title = "Solving the Traveling Salesman Problem Using Efficient
Randomized Parallel Approximation Algorithms",
journal = j-PARALLEL-ALGORITHMS-APPL,
volume = "10",
number = "3--4",
pages = "271--281",
month = "????",
year = "1997",
CODEN = "PAAPEC",
DOI = "https://doi.org/10.1080/10637199708915622",
ISSN = "1063-7192",
MRclass = "68Q25 (68Q22)",
MRnumber = "MR1446424 (98a:68099)",
bibdate = "Fri Jul 11 06:45:43 MDT 2008",
bibsource = "http://www.gbhap-us.com/journals/728/728-toc.htm;
http://www.math.utah.edu/pub/tex/bib/parallelalgorithmsappl.bib;
http://www.mcs.newpaltz.edu/~li/paper.html; MathSciNet
database",
URL = "http://www.informaworld.com/smpp/content~content=a772398799",
acknowledgement = ack-nhfb,
journal-URL = "http://www.tandfonline.com/loi/gpaa20",
remark = "Also cited as v11.",
}
Related entries
- 68Q22,
10(3)165,
10(3)249,
11(1)129,
12(4)265,
12(4)305,
13(1)1,
13(1)27,
13(1)53,
13(1)75
- Efficient,
2(1)81,
2(1)99,
2(1)139,
2(4)245,
4(1)91,
4(3)193,
4(3)281,
7(1)133,
7(3)193,
8(3)195,
10(3)177,
11(3)273,
12(1)143,
13(2)95,
13(4)321,
14(1)79,
14(3)187,
16(4)301,
19(1)33
- Li, Keqin,
13(1)1,
19(4)195
- problem,
1(2)127,
1(4)255,
4(1)125,
4(3)193,
4(3)301,
6(1)79,
6(2)87,
6(2)143,
6(2)179,
6(2)229,
6(4)259,
7(1)121,
8(1)61,
8(3)271,
8(z)400,
9(1)119,
9(3)195,
10(1)49,
10(1)71,
10(1)105,
10(3)225,
10(3)301,
10(3)315,
11(1)113,
13(1)27,
13(2)167,
13(3)239,
13(4)289,
14(2)149,
14(3)187,
15(1)113,
17(1)1,
17(2)147,
17(3)185,
18(1)71,
18(3)121
- Randomized,
14(3)165
- solving,
1(3)243,
2(3)149,
4(3)301,
5(1)57,
7(1)121,
9(3)161,
13(4)289,
14(2)149,
15(1)57
- using,
1(4)315,
2(4)305,
2(4)315,
3(3)287,
3(3)311,
4(3)301,
5(3)199,
5(3)283,
6(2)233,
6(4)259,
8(1)3,
8(3)223,
9(1)1,
10(1)49,
11(3)299,
13(4)321,
14(3)187,
16(4)319,
17(1)41,
17(4)249,
18(1)13,
18(4)197,
19(1)19